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 vote221 views3 answers
Java double to string with comma
Java
7 votes183 views1 answer
Java android join array list
Java
1 vote196 views1 answer
How to add a keylistener to a jframe
Java
103 votes207 views5 answers
Switch expression java
Java
1 vote203 views1 answer
Chemistry formula on Android
Java
0 vote207 views1 answer
Com.android.okhttp.internal.http.HttpURLConnectionImpl cannot be cast to javax.net.ssl.HttpsURLConnection
Java
0 vote186 views1 answer
Android studio set error
Java
191 votes341 views6 answers
Switch java
Java
1 vote209 views1 answer
Java order agnostic binary search
Java
0 vote184 views1 answer
When different programmers write the same program in differing ways and all get the correct result. what is that known as?
Java