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 vote236 views1 answer
Round off and round up
Java
0 vote192 views1 answer
From double to float android studio
Java
2 votes238 views3 answers
Java get first day of the week
Java
0 vote194 views1 answer
Connecting to h2 database from java
Java
1 vote202 views1 answer
Leetcode 416
Java
0 vote206 views1 answer
Int arr = new int
Java
1 vote194 views1 answer
InetAddress.getByAddress example
Java
0 vote234 views1 answer
How to draw Bezier Curve in Android
Java
0 vote194 views2 answers
&& vs & in java
Java
0 vote192 views1 answer
How to change the color of a drawable programmically
Java