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 vote129 views1 answer
Transparent border of jtextfield in java
Java
0 vote123 views1 answer
Implement elasticsearch filter in java
Java
0 vote139 views1 answer
Javafx change textfield background color
Java
1 vote136 views1 answer
Reverse in jaav
Java
0 vote110 views1 answer
Void add method using collections
Java
1 vote122 views2 answers
How to do annotation configuration in spring
Java
0 vote119 views1 answer
How to get child from layout in android
Java
0 vote144 views1 answer
Create new java swing button
Java
0 vote113 views1 answer
Antlr missing argument for lexer command 'channel'
Java
3 votes123 views1 answer
How to make background image transparent in android studio
Java