HackerRank DSA Solutions Tutorial

Inorder Traversal| Tree

❮ Previous Next ❯

Task(easy)

In this challenge, you are required to implement inorder traversal of a tree.
Complete the inOrder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values.

Input Format
Our hidden tester code passes the root node of a binary tree to your $inOrder* function.

Constraints

1 Nodes in the tree ≤ 500

Output Format
Print the tree's inorder traversal as a single line of space-separated values.

Sample Input

Sample Output

1 2 3 4 5 6

Explanation

The tree's inorder traversal results in 1 2 3 4 5 6 as the required result.

SOLUTION 1

def inOrder(root):

    result = []

    def traverse(node):

        if not node:

            return

        traverse(node.left)

        result.append(str(node.info))

        traverse(node.right)

    traverse(root)

    print(" ".join(result))

SOLUTION 2

def inOrder(root):

    #Write your code here

    if root is None:

        return

    inOrder(root.left)

    print(root.info, end = " ")

    inOrder(root.right)

❮ Previous Next ❯

HackerRank DSA Solutions Tutorial

HackerRank DSA Solutions Tutorial

HackerRank DSA Solutions

Inorder Traversal| Tree

Important Links