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 vote300 views1 answer
Check if the given string is a number
Java
0 vote238 views3 answers
Javafx textarea size
Java
0 vote310 views1 answer
Android ecode base64
Java
0 vote291 views1 answer
Jadoh meaning
Java
0 vote295 views1 answer
Instance block in java
Java
1 vote268 views1 answer
Java obtain list string from list object
Java
0 vote282 views1 answer
Spark write partitionby
Java
0 vote297 views1 answer
How do you count characters in a string array in Java?
Java
0 vote274 views1 answer
Add stringarrays to string list java
Java
0 vote323 views1 answer
How to easy get 240 fps in minecraft java
Java