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 vote312 views1 answer
Java new.JFrame();
Java
0 vote355 views2 answers
How to send a byte array in socket java
Java
16 votes256 views3 answers
Randomint java
Java
2 votes367 views1 answer
Full screen in jframe
Java
0 vote400 views3 answers
Spring boot sql logging
Java Spring
0 vote331 views1 answer
Java convert LocalDateTime to long
Java
0 vote301 views1 answer
Java use space in enums
Java
0 vote322 views1 answer
Exceptions in java
Java
4 votes312 views3 answers
What is a package in java
Java
0 vote343 views1 answer
Shared digit java
Java