You are given a tree and you need to do the level order traversal on this tree.
Level order traversal of a tree is breadth-first traversal for the tree.
Level order traversal of above tree is 1 2 3 4 5
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 the 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.
You don't have to take any input. Just complete the function levelOrder() that takes node as parameter and prints the level order. The newline is automatically appended by the driver code.
1 <= T <= 100
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
Testcase1: The tree is
So, the level order would be 1 3 2
Testcase2: The tree is
So, the level order would be 10 20 30 40 60
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.