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 vote320 views1 answer
Java install in fedora
Java
0 vote369 views1 answer
Java boolean even number
Java
6 votes314 views4 answers
Kotlin or java
Java
55 votes316 views4 answers
How to get last element in java
Java
0 vote334 views1 answer
"https://unpkg.com/[email protected]/dist/ThaanaKeyboard.min.js
Java
33 votes320 views6 answers
String to double java
Java
1 vote309 views1 answer
Switch case java with char
Java
0 vote361 views1 answer
Opacity in android studio
Java
0 vote317 views1 answer
Tableau de chaîne de caractère en java
Java
1 vote369 views2 answers
Android java log
Java