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