UGC-NET | UGC NET CS 2015 Jun – II | Question 23

Level order Traversal of a rooted Tree can be done by starting from root and performing:
(A) Breadth First Search
(B) Depth First Search
(C) Root Search
(D) Deep Search


Answer: (A)

Explanation: Level order Traversal of a rooted Tree can be done by starting from root and performing Breadth First Search.
For more information on Level order Traversal Refer:Level Order Tree Traversal
Option (A) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save