Level order traversal of a rooted tree can be done by starting from the root and performing
preorder traversal
in-order traversal
depth first search
breadth first search
Answer is option D.
Breadth first seach.
Level order traversal of a tree is breadth first traversal for the tree.
http://www.geeksforgeeks.org/level-order-tree-traversal/
@ Rishi yadav Does it mean that we don`t 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 doesn`t matter].Is it same?