|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
Given a Binary Tree, your task is to print its level order traversal where 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 task is to complete the method which takes one argument, root of Binary Tree. The struct Node has a data part which stores the data, pointer to left child and pointer to right child.
There are multiple test cases. For each test case, this method will be called individually.
The function should print the level order traversal of the tree as specified in the problem statement .
1 <=T<= 20
1 <= Number of edges<= 1000
1 <= Data of a node<= 100
1 2 R 1 3 L
10 20 L 10 30 R 20 40 L 20 60 R
1 $ 3 2 $
10 $ 20 30 $ 40 60 $
There are two test casess. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes.
Note:The Input/Ouput format and Example given above 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, and should not print anything on stdout/console. The task is to complete the function specified, and not to write the full code.