Level order traversal Line by Line
Easy Accuracy: 39.18% Submissions: 58530 Points: 2

Given a Binary Tree, your task is to find its level order traversal.
For the below tree the output will be 1 $2 3$ 4 5 6 7 $8$.

1
/     \
2        3
/    \     /   \
4     5   6    7
\
8

Example 1:

Input:
1
/
4
/   \
4     2
Output:1 $4$ 4 2 $ Example 2: Input: 10 / \ 20 30 / \ 40 60 Output: 10$ 20 30 $40 60$


This is a function problem. You don't need to read input. Just complete the function levelOrder() that takes nodes as parameter and returns level order traversal as a 2D list.

Note: The driver code prints the levels '\$' separated.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).

Constraints:
1 <= Number of edges <= 1000
0 <= Data of a node <= 100

We are replacing the old Disqus forum with the new Discussions section given below.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  