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 vote155 views1 answer
Check self permission android write_external_storage
Java
0 vote161 views1 answer
8233*4
Java
0 vote194 views1 answer
File with line numbers inserted java
Java
0 vote157 views1 answer
Java read file from command line argument
Java
0 vote170 views1 answer
How to send a message to player in eclipse
Java
0 vote189 views1 answer
Jscrollpane
Java
0 vote170 views1 answer
I need a generic class which extends User class which implement an interface
Java
1 vote208 views1 answer
How to find selenium webelement java
Java
0 vote158 views1 answer
Java integer division tofloat
Java
9 votes170 views1 answer
How to change a character in a string in java with ascii
Java