GATE | GATE-CS-2004 | Question 6

Level order traversal of a rooted tree can be done by starting from the root and performing
(A) preorder traversal
(B) inorder traversal
(C) depth first search
(D) breadth first search


Answer: (D)

Explanation: See this post for details

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.