Compiler-Design
December 21, 2023Question 16566 – Regular-Expression
December 22, 2023Question 9494 – GATE 2004
Level order traversal of a rooted tree can be done by starting from the root and performing
Correct Answer: D
Question 6 Explanation:
Breadth first search:
It is an algorithm for traversing (or) searching tree (or) graph data structures. It starts at the root and explores all of the neighbour nodes at the present depth prior to moving on to the nodes at the next depth level.
It is an algorithm for traversing (or) searching tree (or) graph data structures. It starts at the root and explores all of the neighbour nodes at the present depth prior to moving on to the nodes at the next depth level.
preorder traversal
in-order traversal
depth first search
breadth first search