Level order traversal of a rooted tree can be done by starting from root and performing-
- A.Deep search
- B.Root search
- C.Depth first search
- D.Breadth first search
Show answer
Answer: D. Breadth first search
Level-order traversal is implemented using breadth-first search (BFS).