Level order traversal
Submissions: 25447   Accuracy:


  Difficulty: Easy   Marks: 2

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

Input Format:
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.

Output Format:
The function should print the level order traversal of the tree as specified in the problem statement.

Your Task:
You don't have to take any input. Just complete the function levelOrder that takes node as parameter.

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

Testcase1: The tree is
     /      \
   3       2
So, the level order would be 1 3 2
Testcase2: The tree is
                        /        \
                     20         30
                  /       \
               40       60
So, the level order would be 10 20 30 40 60

Note: The Input/Output format and Example are 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.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Kartik
Author: kartik

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.