Levelorder Traversal Of Binary Tree

easy
1. You are given a partially written BinaryTree class.
2. You are required to complete the body of levelorder function. The function is expected to print tree level by level, left to right. Each level must be on a separate line and elements of same level should be separated by space
3. Input is managed for you.

Input Format

Input is managed for you

Output Format

Each level must be on a separate line and elements of same level should be separated by space

Constraints

None

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
19
50 25 12 n n 37 30 n n n 75 62 n 70 n n 87 n n
Output
50 
25 75 
12 37 62 87 
30 70 
Previous
Size, Sum, Maximum And Height Of A Binary Tree
Next
Iterative Pre, Post And Inorder Traversals Of Binary Tree

Related Questions