Level order traversal

Following figure shows the levels in a tree
level order traversal of the tree is 1, 2, 3, 4, 5

    We are given the root node and we are supposed to print its level order traversal. If we closely examine the steps first we have to do is to print the root node (i.e 1 in the example) then we have to keep track of it's child nodes. Now we have to print 2 and 3 and keep track of their child nodes. It is clear that we cannot simply use a tempnode to keep track of the values in each iteration. And we also need to keep track of the order that is 2 followed by 3 followed by 4 and so on.
   So we are going to use queue data structure here. After printing a node we will enqueue its child elements to the queue. We ll repeat the same procedure until the queue becomes empty. Lets see it more clearly with code and illustration.

Code:

 void levelOrder(Node root) {


    Queue<Node> queue=new LinkedList<>();
    queue.add(root);

    while(!queue.isEmpty()){
        Node tempnode = queue.remove();
        System.out.print(tempnode.data+" ");
        if(tempnode.left!=null)
            queue.add(tempnode.left);
        if(tempnode.right!=null)
            queue.add(tempnode.right);
    }

}

Illustration:

queue.add(root)
 Dequeue the first element in queue, print it and enqueue it's left and right child.
 Dequeue 2 , print it and enqueue its left and right child. Nothing inserted here since both left and right child nodes empty for 2
 Dequeue 3, print in and insert its left and right child i.e, 4 and 5
 Dequeue 4, print it
 Dequeue 5, print it

Comments

Post a Comment

Popular posts from this blog

Tree traversals - Inorder Traversal

Image
        A binary tree can be traversed in two ways. i) Depth First Traversal: Inorder, preorder, postorder ii) Breadth First Traversal: Level Order Traversal Inorder traversal:        In inorder traversal root is visited in between left and right subtree traversals. Steps: 1.  Traverse the left subtree 2.  Visit the root 3. Traverse the right subtree Note: If binary search tree is traversed in inorder, the numbers will be sorted in ascending order. Code: void inOrder(Node root) { if(root==null) return; inOrder(root.left); System.out.print(root.data+" "); inOrder(root.right); } Illustration: Inorder traversal of given tree is 3, 5, 4, 7, 8  Consider the left subtree of 7 (since 7 is the root ,we always start our traversal from root) Here we start form 5, the left subtree of 5 is 3. For 3 the left subtree is empty , So we visit the root. The right subtree of tree is also empty. At ...
Read more

Binary Search tree (Insertion)

Image
   A tree in which every node can have a maximum of two children is called a binary tree.       A binary search tree is a binary tree in which every node has lower values in the left sub tree and higher values in the right sub tree. Node of binary tree: class Node{      int data;      Node left, right;      Node(int data){         this.data = data;         right = left = null;      } } BST - Insertion:  static Node Insert(Node root,int data) {      if( root == null ){            root = new Node(data);            return root;      }      if( data < root.data)             root.left = Insert(root.left,data);      else             root.right = Insert(root.rig...
Read more

Stack implementation using array

Image
    Introduction:    Stack is a linear data structure which follows LIFO( Last In First Out ) order.   To represent stack consider books are placed in table for the teacher to correct. The note which is submitted last will be corrected first. The person who submits last is quite unlucky isn't it :P Operations: push: Inserts element at the top of the stack pop: Removes element from the top of the stack Stack implementation using array: Code: import java.util.*; import java.lang.*; import java.io.*; class Stack {     int SIZE = 10;     int arr[] = new int[SIZE];     int top = -1;          public int pop(){         if (top == -1){             System.out.println("stack is empty");             return 0;         }         int topelement ...
Read more