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 vote222 views1 answer
Create method setsupportactionbar
Java
0 vote173 views1 answer
Javafx how to change shape color
Java
0 vote188 views1 answer
Bukkit e.getCurrentItem() bytes?
Java
0 vote175 views1 answer
Generate infinity steam java
Java
2 votes164 views1 answer
Jagx stock
Java
0 vote182 views1 answer
Java how to handle HTTP GET request after establishing TCP connection
Java
-1 vote223 views1 answer
Spring boot show sql
Java Spring
0 vote236 views1 answer
Get logged-in user in Spring Security
Java Spring
4 votes281 views1 answer
Select a random element from a list java
Java
0 vote287 views1 answer
Google intent for directions
Java