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

5 votes301 views4 answers
Cors spring boot
Java
0 vote370 views1 answer
Draaiom
Java
14 votes337 views4 answers
Java create txt file
Java
1 vote356 views3 answers
Admin lte laravel
Java
0 vote414 views1 answer
Modelmapper abstract class
Java
13 votes341 views2 answers
Dictionary in java
Java
0 vote358 views2 answers
How to set slected row color in javafx tableview
Java
0 vote356 views1 answer
Java regex check if group exists
Java
0 vote449 views1 answer
How to find the logged-in user in Spring Boot?
Java Spring
1 vote342 views1 answer
Binary Search Descending Order Sorted Array
Java