Level Order cpp soln

#1

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

Example :
Given binary tree

3

/
9 20
/
15 7

return its level order traversal as:

[
[3],
[9,20],
[15,7]
]

Also think about a version of the question where you are asked to do a level order traversal of the tree when depth of the tree is much greater than number of nodes on a level.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
#2

hey @Kash-Moulik-3715574511847721 what issue are you getting in this problem?

#3

IM not able to get the que so can u help me to solve it??

#4

So what questions say is
suppose you have a binary tree like this
image
the level order print of this binary tree would be
10
5 19
1 6 17 21
that is printing exact binary tree from left to right , level by level.

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.