UTpaper

Free mock tests & test series

Question 9Asked in UGC NET Computer Science, June 2015 (Paper II & III, Selected Questions)

Level order Traversal of a rooted Tree can be done by starting from root and performing :

  1. ABreadth first search
  2. BDepth first search
  3. CRoot search
  4. DDeep search
Show answerHide answer

Correct answer: (A) Breadth first search

Explanation

Level order traversal is similar to breadth first search, whereas preorder traversal is similar to depth first search. So the answer is (a).

From UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions)

This is question 9 of UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.