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 vote299 views1 answer
Spring boot bean configuration
Java Spring
0 vote264 views1 answer
Papermc api maven
Java
0 vote270 views1 answer
Java fahrenheit to celsius
Java
0 vote290 views1 answer
How to preset an array java
Java
2 votes276 views2 answers
Kotlin variable in string
Java
0 vote349 views1 answer
Spring boot send username in email html template
Java Spring
0 vote279 views1 answer
Minecraft addlayer(u) in the type rendererlivingentity<t> is not applicable for the arguments
Java
4 votes268 views1 answer
Remeove space between date and time java
Java
1 vote274 views1 answer
Java restart while loop
Java
0 vote286 views1 answer
Javafx access fxml elements
Java