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 vote124 views1 answer
Spigot disable join message
Java
0 vote111 views1 answer
Os compatible java path separator
Java
0 vote121 views1 answer
Authentication in spring boot
Java
0 vote113 views1 answer
How to check grant permissions in android
Java
1 vote120 views1 answer
Java calculate delta time from thread
Java
0 vote123 views1 answer
Android view set border programmatically
Java
3 votes77 views1 answer
Java jdk set path windows 10
Java
2 votes73 views1 answer
Factors
Java
37 votes114 views4 answers
Queue in java
Java
0 vote114 views2 answers
How-to-use-volley-string-request-in-android
Java