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

0 vote267 views1 answer
Java program finish event
Java
0 vote274 views2 answers
How to send gmail using spring boot in java code
Java Spring
0 vote278 views10 answers
Convert java code to c++ online
Java
0 vote266 views1 answer
Jtable fill panel
Java
0 vote286 views1 answer
Operation sur les dates java
Java
0 vote269 views1 answer
Get intersection of two lists java
Java
11 votes281 views3 answers
Ubuntu change java version
Java
0 vote309 views1 answer
Number output swing java
Java
0 vote269 views2 answers
Integrity check failed: java.security.NoSuchAlgorithmException: Algorithm HmacPBESHA256 not available jks
Java
0 vote276 views1 answer
Offsetdattime to date
Java