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 vote351 views1 answer
Javafx filechooser specific file
Java
3 votes345 views1 answer
Java make all interfaces implement another
Java
0 vote380 views2 answers
Send gmail from java spring boot
Java
0 vote379 views1 answer
Hashmap get value by key java
Java
0 vote371 views1 answer
How to make character in jframe
Java
0 vote383 views1 answer
Hide background of button java swing
Java
0 vote437 views1 answer
Spring boot return 201 created
Java Spring
0 vote320 views1 answer
Java truncate bigdecimal
Java
0 vote318 views1 answer
Tostring javadoc
Java
0 vote341 views1 answer
Find out duplicate number between 1 to n numbers in java
Java