• 0

Print Binary Tree level by level
  • Posted: 7 years ago
  • Updated: 6 years ago
  • Edit
  • answers (1)
  • views (6400)

Design an algorithm to print a binary tree, level by level, starting from the root.


Posted Answers

  • Posted: 7 years ago
  • Updated: 7 years ago
  • 0 0
  • Edit

We can print the binary tree, levelwise, using a \( queue \).


  • Create an empty queue
  • The root of the tree is added in the queue.
  • The queue is removed and printed. If the removed item has any child(ren), add it/them in the queue.
  • Repeat the last step untill the queue is empty.

Running time = \( O(n) \).


 
public static void printBinaryTreeByLevel(Node node){

    Queue   queue = new LinkedList  ();
    queue.add(node);

    while(queue.size() > 0){
        Node currentNode = queue.remove();
        System.out.println(currentNode.value + “ ”);

        if(currentNode.left! = null)
                queue.add(currentNode.left);

        if(currentNode.right! = null)
                queue.add(currentNode.right);
    }

 }
You need to Sign In to post your solution.