GATE CSE 2004 | Question: 6

Question

Level order traversal of a rooted tree can be done by starting from the root and performing

• A. preorder traversal

• B. in-order traversal

• C. depth first search

• D. breadth first search

Comments

Let L mean Left Sub-tree and R mean Right Sub-tree

• Preorder traversal: Root, then L, then R
• Inorder traversal: L, then Root, then R
• Postorder traversal: L, then R, then Root
• Levelorder traversal: Start from the root and call BFS.

---

Done by BFS .

You can attempt here:- https://www.geeksforgeeks.org/problems/level-order-traversal/1

Answer 1

Answer is option D.

Breadth first seach.

Answer 2

Level order traversal of a tree is breadth first traversal for the tree.

http://www.geeksforgeeks.org/level-order-tree-traversal/

Comments

@ Rishi yadav Does it mean that we don`t care about order in which nodes are there in level like left to right,
Because while implementing BFS we tend to go for adjacent node [order doesn`t matter].Is it same?

---

Basically in a tree we traverse from  left to right @saxena0612

Answer 3

option D is the correct answer

Level order traversal of the tree resembles the Breadth-first search of the graph

and also

one more important point regarding the LEVEL ORDER TRAVERSAL apart from the question asked is :

 level order traversal uses the queued data structure.