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 vote139 views1 answer
Java replace all not number
Java
0 vote135 views1 answer
Background for anchor in javafx
Java
4 votes128 views1 answer
Remeove space between date and time java
Java
2 votes200 views1 answer
Cannot lock java compile cache as it has already been locked by this process
Java
1 vote135 views1 answer
Get value google sheet with app script
Java
0 vote123 views1 answer
ORM for Android
Java
53 votes153 views6 answers
Get last index of array java
Java
0 vote149 views1 answer
Java check if string appears twice in arraylist
Java
0 vote125 views1 answer
Instantiate matrix java
Java
0 vote136 views1 answer
Read csv java android
Java