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 vote366 views1 answer
Java swing place objects vertically
Java
0 vote378 views1 answer
Click selectable in androiod
Java
6 votes340 views1 answer
Arrays sort 2d array java
Java
0 vote339 views1 answer
Intelij show method information
Java
0 vote336 views4 answers
Commenting in Java
Java
0 vote338 views2 answers
Dropdown show hide div event in jsp
Java
0 vote364 views2 answers
Finding the ASCII value of a Character in java
Java
0 vote366 views1 answer
Uri/beecrowd problem no 1118 solution in Java
Java
0 vote364 views1 answer
Priority queue java comparator lambda
Java
5 votes393 views4 answers
Kotlin vs java
Java