Binary tree level traversal

    public static void levelOrderTraversal(Node root)
    {
        // base case
        if (root == null) {
            return;
        }
 
        // create an empty queue and enqueue the root node
        Queue<Node> queue = new ArrayDeque<>();
        queue.add(root);
 
        // to store the current node
        Node curr;
 
        // loop till queue is empty
        while (!queue.isEmpty())
        {
            // process each node in the queue and enqueue their
            // non-empty left and right child
            curr = queue.poll();
 
            System.out.print(curr.key + " ");
 
            if (curr.left != null) {
                queue.add(curr.left);
            }
 
            if (curr.right != null) {
                queue.add(curr.right);
            }
        }
    }

Source: techiedelight.com

Similar codes

1 vote110 views6 answers
Android hide keyboard
Java
0 vote100 views1 answer
Java oop design patterns
Java
0 vote67 views1 answer
Api for exchange rates
Java
7 votes113 views3 answers
Java find largest number in list
Java
0 vote114 views1 answer
Reverse sentence in java
Java
1 vote128 views2 answers
Java join list of strings
Java
0 vote93 views1 answer
Number of zeros in a binary array
Java
4 votes114 views5 answers
What are variables in java
Java
0 vote141 views1 answer
Fix intellij resetting the java version everytime you add a dependency
Java
1 vote114 views1 answer
Java jtextfield text bold
Java