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

0 vote136 views1 answer
Fragment to fragment
Java
2 votes132 views3 answers
Palindrome range in java
Java
0 vote150 views1 answer
Java lamda
Java
0 vote143 views1 answer
Keytool error: java.io.FileNotFoundException: my-release-key.keystore (Access is denied) java.io.FileNotFoundException: my-release-key.keystore (Access is denied)
Java
0 vote160 views1 answer
Spring boot send api request
Java Spring
13 votes141 views2 answers
Java stringbuilder set value
Java
2 votes135 views1 answer
Why are there no destructors in java?
Java
135 votes352 views6 answers
Java random number generator
Java
0 vote139 views1 answer
.jar window immediately closes on doubleclick
Java
1 vote138 views2 answers
Start fragment from activity
Java