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

1 vote101 views2 answers
Java list average
Java
0 vote102 views1 answer
One space diagonally in java
Java
2 votes149 views1 answer
Android studio remove notification bar
Java
1 vote179 views1 answer
Java product 1 to n
Java
0 vote138 views1 answer
Ubuntu java development kit
Java
0 vote153 views1 answer
Java multiple implements
Java
1 vote157 views1 answer
American heavy tanks of ww2
Java
0 vote137 views1 answer
Algorithms - transformation
Java
4 votes153 views3 answers
Swagger
Java
4 votes132 views1 answer
Thread
Java