Level order traversal of a rooted tree can be done by starting from the root…
GATE · 2004 · CS
Level order traversal of a rooted tree can be done by starting from the root and performing
- A.
preorder traversal
- B.
inorder traversal
- C.
depth first search
- D.
breadth first search
Attempted by 1239 students.
Sign up free to check your answer
Sign up freeLoading lesson…