recategorized by
6,388 views
19 votes
19 votes

Level order traversal of a rooted tree can be done by starting from the root and performing

  1. preorder traversal

  2. in-order traversal

  3. depth first search

  4. breadth first search

recategorized by

3 Answers

7 votes
7 votes
2 votes
2 votes
option D is the correct answer

Level order traversal of the tree resembles the Breadth-first search of the graph

and also

one more important point regarding the LEVEL ORDER TRAVERSAL apart from the question asked is :

 level order traversal uses the queued data structure.
Answer:

Related questions

27 votes
27 votes
3 answers
1
Kathleen asked Sep 18, 2014
5,595 views
The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
19 votes
19 votes
4 answers
3
Kathleen asked Sep 18, 2014
6,945 views
The best data structure to check whether an arithmetic expression has balanced parentheses is aqueuestacktreelist
27 votes
27 votes
6 answers
4
Kathleen asked Sep 18, 2014
22,418 views
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the heigh...