1.3k views

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 | 1.3k views

Answer is option D.

answered by Active (3.3k points)
edited
answered by Boss (10.5k points)
0

Rishi yadav Does it mean that we dont care about order in which nodes are there in level like left to right,
Because while implementing BFS we tend to go for adjacent node [order doesnt matter].Is it same?

0
Basically in a tree we traverse from  left to right @saxena0612

1
2