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

23 votes280 views1 answer
Bootstrap messages red
Java
7 votes289 views4 answers
Java execution time
Java
1 vote311 views1 answer
Spring scheduled
Java
1 vote288 views2 answers
How to do annotation configuration in spring
Java
0 vote276 views1 answer
How to iterate list of string array in java
Java
6 votes300 views2 answers
How to run a java file in terminal
Java
3 votes238 views1 answer
Java main class
Java
1 vote281 views1 answer
Java create file and parent directories
Java
0 vote311 views1 answer
Could not determine java version from
Java
16 votes230 views3 answers
Randomint java
Java