Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com

Level Order Traversal

Easy
0/40
Average time to solve is 15m
profile
Contributed by
79 upvotes
Asked in companies
CiscoMicrosoftMcAfee

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

Example

The level order traversal will be {1,2,3,4,5,6,7}.
Detailed explanation ( Input/output format, Notes, Images )
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 :

Example

1
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.
Constraints:
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
Sample Input 1:
3
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
1 2 3 -1 -1 -1 -1
1 3 -1 2 -1 -1 -1
Sample Output 1:
1 2 3 4 5 6 7
1 2 3
1 3 2
Explanation of Sample Input 1:
 For the first test case, {1} is at level 1 and {2,3} are at level 2 and {4,5,6} are at level 3 and {7} is at level 4. So combinations of all levels are {1, 2, 3 ,4, 5, 6, 7}.

For the second test case, {1} is at level 1 and {2,3} are at level 2. So combinations of level are {1, 2, 3}.

For the third test case, {1} is at level 1 and {3} is at level 2 and {2} is at level 3. So combinations of all levels are {1,3,2}.
Sample Input 2:
2
2 7 5 2 6 -1 9 -1 -1 5 11 4 -1 -1 -1 -1 -1 -1 -1
1 2 3 4 -1 5 6 -1 -1 -1 -1 -1 -1  
Sample Output 2:
2 7 5 2 6 9 5 11 4
1 2 3 4 5 6
Explanation of Sample Input 2:
For the first test case, {2} is at level 1 and {7,5} are at level 2 and {2,6,9} are at level 3 and {5,11,4} are at level 4. So combinations of all levels are {2, 7, 5, 2, 6, 9, 5, 11, 4}.

For the second test case, {1} is at level 1 and {2,3} are at level 2 and {4,5,6} are at level 3. So combinations of all levels are {1, 2, 3, 4, 5, 6}.
Hint

Which data structure can be used to traverse level by level in the given tree?

Approaches (1)
Breadth First Search

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”.
Time Complexity

O(N), where ‘N’ is the number of nodes in the given binary tree.


We are using the level order traversal, in which there will be ‘N’ push and ‘N’ pop operations, where push and pop operation will take constant time for the queue data structure. So overall time complexity will be O(N).

Space Complexity

O(N), where ‘N’ is the number of nodes in the given binary tree.


We are storing all the nodes for returning the answer; thus, the answer will be the size of ‘N’, and also, we are using the level order traversal. So in the worst case, when the given binary tree will be the balanced binary tree, then the total number of nodes at the bottom level of the tree will be ((N/2)+1). So at the bottom level size of the queue will be the order of O(N). So overall space complexity will be O(N).

Video Solution
Unlock at level 3
(75% EXP penalty)
Code Solution
(100% EXP penalty)
Level Order Traversal
All tags
Sort by
Search icon

Interview problems

Level Order Traversal || Java || Tc: O(n)

public static ArrayList<Integer> getLevelOrder(BinaryTreeNode root) {

    ArrayList<Integer> treelist = new ArrayList<>();

    Queue<BinaryTreeNode> queue = new LinkedList<>();

 

    if(root == null){

        return treelist;

    }

    queue.offer(root);

 

    while(!queue.isEmpty()){

        int size = queue.size();

        for(int i=0; i<=size-1; i++){

            if(queue.peek().left != null){

                queue.offer(queue.peek().left);

            }

            if(queue.peek().right != null){

                queue.offer(queue.peek().right);

            }

            treelist.add(queue.poll().val);

        }      

    }

    return treelist;

  }

11 views
0 replies
0 upvotes

Interview problems

level order traversal with queue | eaisest

#include <bits/stdc++.h> 

/************************************************************

 

    Following is the BinaryTreeNode class structure

 

    template <typename T>

    class BinaryTreeNode {

       public:

        T val;

        BinaryTreeNode<T> *left;

        BinaryTreeNode<T> *right;

 

        BinaryTreeNode(T val) {

            this->val = val;

            left = NULL;

            right = NULL;

        }

    };

 

************************************************************/

vector<int> getLevelOrder(BinaryTreeNode<int> *root)

{

    //  Write your code here.

    vector<int> ans;

    if(root == NULL) return ans;

    queue<BinaryTreeNode<int>*> q;

    

 

    q.push(root);

 

    while(!q.empty()){

        BinaryTreeNode<int>* node=q.front();

        ans.push_back(node->val);

        if(node->left != NULL) q.push(node->left);

        if(node->right) q.push(node->right);

        q.pop();

        }

  return ans;

}

73 views
0 replies
0 upvotes

Interview problems

Level Order Traversal Easy CPP Solution using Queue 100%

void levelOrderQueue(BinaryTreeNode<int> *root , vector<int> &ans){ // BFS --> VVVV IMP

    queue<BinaryTreeNode<int> *> q ;

    q.push(root); 

 

    while(q.size() >0){

        BinaryTreeNode<int> * temp =q.front ();

        q.pop();

        ans.push_back(temp->val);

        if(temp->left != NULL) q.push(temp->left);

        if(temp->right != NULL) q.push(temp->right);

    }

}

vector<int> getLevelOrder(BinaryTreeNode<int> *root)

{

    //  Write your code here.

    vector<int> ans ;

    if(root == NULL ) return ans ;

    levelOrderQueue(root , ans);

    return ans ;

 

}

algorithms

datastructures

38 views
0 replies
0 upvotes

Python

def getLevelOrder(root):

    if not root:

        return []

    queue = deque([root])

    ans = []

 

    while queue:

        element = queue.popleft()

        ans.append(element.val)

 

        if element.left:

            queue.append(element.left)

        if element.right:

            queue.append(element.right)

    return ans

36 views
0 replies
0 upvotes

Interview problems

C++ soln_ with TC->O(N) && SC_>O(N)!!

vector<int> getLevelOrder(BinaryTreeNode<int> *root)

{

    vector<int> ans;

    if(root == nullptr) return ans;

    queue<BinaryTreeNode<int>*> q;

    q.push(root);

    while (!q.empty()) {

      BinaryTreeNode<int> *temp = q.front();

      q.pop();

      ans.push_back(temp->val);

      if (temp->left)

        q.push(temp->left);

      if (temp->right)

        q.push(temp->right);

    }

    return ans;

}

304 views
0 replies
0 upvotes

Interview problems

breath first search || java || well explained at every step

public static ArrayList<Integer> getLevelOrder(BinaryTreeNode root) {

      if(root==null) return new ArrayList<>();

      //creating a list to store all element level wise;

    ArrayList<Integer> arr=new ArrayList<>();

    //creating queue that contains TreeNodes;

    Queue<BinaryTreeNode> q=new LinkedList<>();

    //inserting root node in queue;

    q.add(root);

    while(!q.isEmpty()){

        int level=q.size();

        for(int i=0;i<level ;i++){

            //inserting left and right element in queue if it is not null;

            if(q.peek().left!=null) q.add(q.peek().left);

            if(q.peek().right!=null) q.add(q.peek().right);

            //after that remove pq.peek and insert its value in list;

            arr.add(q.remove().val);

        }

    }

    return arr;

  }

81 views
0 replies
0 upvotes

Interview problems

Simple C++ Code using queue

vector<int> getLevelOrder(BinaryTreeNode<int> *root)

{

    //  Write your code here.

    vector<int> ans;

    if(!root) return ans;

    queue<BinaryTreeNode<int>*> q;

 

    q.push(root);

 

    while(q.size()){

        BinaryTreeNode<int>* temp = q.front();

        q.pop();

        ans.push_back(temp->val);

        if(temp->left) q.push(temp->left);

        if(temp->right) q.push(temp->right);

    }

 

    return ans;

}

184 views
0 replies
0 upvotes

Interview problems

Easy for C++

Time complexity O(n)

Space complexity O(n)

79 views
0 replies
0 upvotes

Interview problems

easy Solution in java with tc:O(N)

import java.util.* ;

import java.io.*; 

/*

 

    Following is the structure used to represent the Binary Tree Node

 

    class BinaryTreeNode<T> {

        T val;

        BinaryTreeNode<T> left;

        BinaryTreeNode<T> right;

 

        public BinaryTreeNode(T val) {

            this.val = val;

            this.left = null;

            this.right = null;

        }

    }

 

*/

 

import java.util.ArrayList;

 

public class Solution

 {

 

  public static ArrayList<Integer> getLevelOrder(BinaryTreeNode root) 

  {

      // tree is empty

        if(root==null)

        {

            return new ArrayList<>();

        }

        //create the arraylist to sore ans 

        ArrayList<Integer> ans = new ArrayList<>();

        //create the queue (use proprty of queue which is fifo )

        Queue<BinaryTreeNode> q1=new LinkedList<>();

        //add fist root node and null manually in queu

         q1.add(root);

         q1.add(null);

         //traverse the queu

         while(!q1.isEmpty())

         {

             BinaryTreeNode currentNode = q1.remove();

                      // current node is empty

                      if(currentNode==null)

                      {

                          System.out.println();

                          //if queu is empty check beause adding null everytime

                          if(q1.isEmpty())

                          {

                               break;

                          }

                          else

                          {

                               q1.add(null);

                          }

                      }

             

                    else

                    {

                       ans.add(currentNode.val);

                     if(currentNode.left!=null)

                     {

                         q1.add(currentNode.left);

                     }

                     if(currentNode.right!=null)

                     {

                         q1.add(currentNode.right);

                     }

                  }

             

         }

          return ans;

  }

 

}

68 views
0 replies
0 upvotes

Interview problems

Level order traversal of binary tree using queue in C++

vector<int> getLevelOrder(BinaryTreeNode<int> *root)

{

    if(root==NULL) return {};

   vector<int> ans;

   queue<BinaryTreeNode<int>*> q;

   q.push(root);

   while(!q.empty()){

       int size = q.size();

       for(int i=0; i<size; i++){

           BinaryTreeNode<int> * node = q.front();

           q.pop();

           if(node->left) q.push(node->left);

           if(node->right) q.push(node->right);

           ans.push_back(node->val);

       }

   }

   return ans;

}

114 views
0 replies
0 upvotes
Full screen
Console