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

6 votes248 views3 answers
Onclick listener android
Java
1 vote274 views1 answer
Could not initialize class org.jetbrains.kotlin.gradle.plugin.sources.DefaultKotlinSourceSetKt
Java
2 votes200 views1 answer
How to make java list
Java
3 votes239 views1 answer
Composition java
Java
0 vote205 views1 answer
Add certificate to java truststore
Java
0 vote212 views2 answers
Darkhub
Java
0 vote284 views1 answer
Operation sur les dates java
Java
2 votes205 views2 answers
Check if java is installed windows
Java
2 votes207 views2 answers
How to split string in java android
Java
2 votes219 views1 answer
Prendere valore da tastiera java
Java