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 vote141 views1 answer
Antialiasing kjava
Java
0 vote149 views1 answer
Uri/Beecrowd problem no - 1150 solution in Java
Java
65 votes160 views6 answers
Java last element of array
Java
5 votes196 views3 answers
Failed to execute goal org.apache.maven.plugins:maven-surefire-plugin:2.19.1:test (default-test) on project
Java
1 vote148 views3 answers
Reverse number in java
Java
0 vote151 views1 answer
Initialize arraylist in 1 line in java
Java
0 vote141 views2 answers
Https://www.baeldung.com/hibernate-inheritance
Java
0 vote153 views1 answer
Read java reader
Java
8 votes158 views1 answer
Java convert a string to char[]
Java
0 vote170 views1 answer
AccountDriver.java
Java