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

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

From the Combined Bank Officer (IT) October 2024 – Preliminary (BIBM) exam, question 77 of 95.

More from this paper

Previous: Suppose you are given a binary tree with 11 nodes, such that each node has exactly either zero or two children. The maximum height of the…
Next: Which one is correct in case of normalization-
All questions in Combined Bank Officer (IT) October 2024 – Preliminary (BIBM)