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 vote224 views1 answer
String replace last character java
Java
0 vote236 views1 answer
Awk print second
Java
0 vote267 views1 answer
Mapping over a list of promises in javaascript
Java
0 vote243 views1 answer
How to change numbers to English in printf
Java
7 votes219 views1 answer
AdapterView OnItemClickListener
Java
-2 votes230 views1 answer
Java return exception
Java
0 vote243 views1 answer
Jaggies
Java
0 vote249 views1 answer
Add close button on right top corner of alert dialog box for android
Java
10 votes207 views4 answers
Start new activity android
Java
11 votes213 views1 answer
Declare a hashmap in java
Java