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 vote206 views2 answers
Decision tree drools using spring boot
Java
86 votes222 views8 answers
Java hello world
Java
0 vote214 views1 answer
Java dynamically add to a combobox
Java
-2 votes169 views1 answer
How to implements interface in java
Java
0 vote245 views1 answer
Example of a FOR Loop
Java
-1 vote270 views1 answer
Spring boot show sql
Java Spring
0 vote205 views1 answer
Java csv line split
Java
0 vote209 views1 answer
Java date bigger than
Java
0 vote212 views1 answer
Creating jdbc connection in java using service name oracle
Java
0 vote212 views1 answer
Bukkit shutdown
Java