Given a Binary Tree, your task is to print its level order traversal such that each level is separated by $.
For the below tree the output will be 1 $ 2 3 $ 4 5 6 7 $ 8 $.
/ \ / \
4 5 6 7
The first line of input contains the number of test cases T. For every test case, the only line of input contains a string representing the tree as described below:
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
For each test case, in a new line, print the output in the required format.
This is a function problem. You don't need to read input. Just complete the function levelOrder() that takes nodes as parameter and prints level order line-by-line. The newline for every test case is automatically appended by the driver code.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).
1 <= T<= 100
1 <= Number of edges <= 1000
1 <= Data of a node <= 100
1 4 N 4 2
10 20 30 40 60 N N
1 $ 4 $ 4 2 $
10 $ 20 30 $ 40 60 $
Testcase1: The tree is
So, the level order would be 1 $ 4 $ 4 2 $
Testcase2: The tree is
So, the level order would be 10 $ 20 30 $ 40 60 $
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.