why are so many problems of trees present in graph on interview bit?
Because Tree is a directed acyclic graph
Although the question is repeated.learning lies in this part “do a level order traversal of the tree when depth of the tree is much greater than number of nodes on a level.”
As depth of tree is much greater than number of nodes on a level.BFS will be much more memory intensive. Instead we can use DFS with height labelling.