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

49 votes378 views3 answers
Ex:javascript loop array
Java
0 vote351 views1 answer
Processing - Save n number of frames
Java
0 vote340 views1 answer
Janaaa_Sa
Java
0 vote347 views1 answer
Java netbeans textfield only numbers
Java
0 vote365 views1 answer
Java platform runlater keeps running
Java
0 vote352 views1 answer
Sleep for milliseconds in java
Java
3 votes350 views5 answers
Convert java code to kotlin online editor
Java
0 vote343 views1 answer
Get device id programmatically android
Java
29 votes347 views3 answers
Array of char to string in java
Java
0 vote352 views2 answers
Matrix diagonal sum leetcode
Java