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 vote123 views1 answer
Mysql connection details in springboot
Java
0 vote121 views1 answer
Retrofit post body
Java
6 votes115 views1 answer
Javafx tableview clear all data
Java
2 votes125 views1 answer
Taking date as input in java
Java
3 votes112 views1 answer
New in japanese
Java
0 vote164 views1 answer
A Java-8 stream of batches,
Java
5 votes140 views2 answers
Arraylist with values java
Java
0 vote112 views1 answer
Parallel sorting in java 8
Java
0 vote108 views1 answer
How to skip a line with a filewriter java
Java
2 votes156 views1 answer
Full screen in jframe
Java