HackerRank DSA Solutions Tutorial

Level Order Traversal| Tree

❮ Previous Next ❯

Task(easy)

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the level order function and print the values in a single line separated by a space.

For example:

/ \

3 6

For the above tree, the level order traversal is 1 -> 2 -> 5 -> 3 -> 6 -> 4.

Input Format

You are given a function,

void levelOrder(Node * root) {

}

Constraints

 1 <= Nodes in the tree <= 500.

Output Format

Print the values in a single line separated by a space.

Sample Input

Sample Output

1 2 5 3 6 4

Explanation

We need to print the nodes level by level. We process each level from left to right.
Level Order Traversal 1 -> 2 -> 5 -> 3 -> 6 -> 4: .

SOLUTION 1

from collections import deque

def levelOrder(root):

    bfs, result = deque([root]), []

    while bfs:

        node = bfs.popleft()

        result.append(node)

        if node.left:

            bfs.append(node.left)

        if node.right:

            bfs.append(node.right)

    print(" ".join(map(str, result)))

❮ Previous Next ❯

HackerRank DSA Solutions Tutorial

HackerRank DSA Solutions Tutorial

HackerRank DSA Solutions

Level Order Traversal| Tree

Important Links