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 vote141 views2 answers
How to calculate min, max and average and write the output into into a text file in java
Java
2 votes133 views10 answers
Javascript
Java
115 votes182 views6 answers
Reverse a string
Java
2 votes130 views1 answer
Java guid
Java
1 vote129 views1 answer
Java if or
Java
0 vote124 views1 answer
Java get number of threads
Java
0 vote125 views1 answer
Java jframe image
Java
2 votes132 views1 answer
Java garbage collection
Java
0 vote141 views1 answer
Compare integers java sort
Java
0 vote132 views1 answer
Get all keys from pbject javascirpt
Java