Code360 powered by Coding Ninjas X Code360 powered by Coding Ninjas X
Last Updated: 14 Oct, 2020

Level Order Traversal

Asked in companies

Problem statement

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:
For the given binary tree


The level order traversal will be {1,2,3,4,5,6,7}.
Input Format:
The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
The first line of each test case contains elements of the tree in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 in its place.

For example, the input for the tree depicted in the below image would be :


2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1

Explanation :

Level 1 :
The root node of the tree is 1

Level 2 :
Left child of 1 = 2
Right child of 1 = 3

Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6

Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)

Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)

The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null(-1).
Note :
The above format was just to provide clarity on how the input is formed for a given tree. 
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:

1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
Output Format:
Print all the nodes in level order traversal separated by a single space.
For each test case, print the output in a new line.
Note :
You do not need to print anything; it has already been taken care of.
1 <= T <= 100
0 <= N <= 1000
0 <= data <= 10^6 and data != -1
Where ‘T’ is the number of test cases, and ‘N’ is the total number of nodes in the binary tree, and “data” is the value of the binary tree node.

Time Limit: 1sec


01 Approach

In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes of the next level from the queue. We will keep doing until our queue does not become empty and store all the nodes into “output”. Steps are as follows:

  1. Define a queue let’s say as “level”.
  2. Push the root of the given tree into the ”level”.
  3. We will keep doing the following operations until “level” does not become empty:
    • Get the size of the queue, i.e. the total number of nodes at the current level.
    • Visit all the nodes one by one which is at the current level and store values corresponding to that node into “output”. Push their left and right child into the queue if they exist.
  4. Return the “output”.