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 vote180 views1 answer
How to summon lightning in minecraft
Java
0 vote169 views1 answer
Terminate function calling in java
Java
1 vote152 views1 answer
Android sqlite select query
Java
-1 vote170 views2 answers
Java Arrays method
Java
0 vote158 views1 answer
If en une seul ligne java
Java
8 votes174 views1 answer
Import java math
Java
7 votes201 views2 answers
Read double java
Java
0 vote167 views1 answer
Java nested array hashcode
Java
0 vote164 views1 answer
Autowired in spring boot error creating bean with name
Java
0 vote171 views1 answer
How to use Log android studio Java
Java