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 vote171 views1 answer
Java get all items from arraylist
Java
1 vote147 views1 answer
"java.lang.NoClassDefFoundError: org/yaml/snakeyaml/LoaderOptions"
Java
2 votes167 views6 answers
How to reverse a number in java
Java
5 votes148 views2 answers
Math.absolute java
Java
1 vote167 views1 answer
Java create file
Java
2 votes157 views1 answer
Get instance of object java
Java
0 vote152 views1 answer
Date(Long) to integer and back
Java
1 vote156 views1 answer
Check if char equals java
Java
-1 vote195 views1 answer
Get spring application context
Java Spring
2 votes184 views3 answers
List in java
Java