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

2 votes171 views1 answer
Java random unique number
Java
0 vote182 views3 answers
How to cut a certion part from a string in java
Java
1 vote175 views1 answer
How to traverse stack in java
Java
0 vote174 views1 answer
Jsp form upload image
Java
0 vote193 views2 answers
Find if element is powers of 2
Java
0 vote181 views1 answer
Sealed interface java codegrepper
Java
3 votes162 views1 answer
Java console write
Java
1 vote215 views2 answers
Variables en java
Java
0 vote196 views1 answer
Caused by: java.sql.sqlexception: no database selected
Java
10 votes186 views5 answers
Array average
Java