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 vote221 views1 answer
Destroy fragent after navigating
Java
0 vote215 views1 answer
Crazy error
Java
0 vote182 views1 answer
Api for exchange rates
Java
0 vote239 views1 answer
Java read directory
Java
0 vote205 views1 answer
Can i call another function from main hava
Java
0 vote267 views1 answer
Spring jpa add field to many to many table
Java
0 vote214 views1 answer
BodyContentImpl memory leak
Java
0 vote225 views1 answer
Longadder
Java
1 vote234 views1 answer
Jdk path ubuntu
Java
0 vote237 views1 answer
Localdatetimw java input
Java