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

30 votes115 views10 answers
Print hello world in java
Java
0 vote171 views1 answer
Why is write replacing my text java
Java
0 vote125 views1 answer
How to hide complete layout in xml android studio
Java
0 vote162 views1 answer
Spring.jpa.properties.hibernate.dialect values
Java
0 vote171 views2 answers
Navigation view item selected
Java
0 vote176 views1 answer
Why the fuck java suck
Java
1 vote172 views3 answers
Javafx textarea font size
Java
0 vote171 views1 answer
Acceder a elementos de list java
Java
0 vote161 views1 answer
Sudoku 6x6 java
Java
0 vote159 views1 answer
Get generic type of class at runtime
Java