Open In App

GATE | GATE-CS-2004 | Question 6

Like Article
Like
Save
Share
Report

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


Last Updated : 10 Jul, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads