Cerinta completa

In this challenge, you are required to implement inorder traversal of a tree.

Complete the function in your editor below, which has 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

Output Format

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

Sample Input

     1
      \
       2
        \
         5
        /  \
       3    6
        \
         4

Sample Output

1 2 3 4 5 6

Explanation

The tree’s inorder traversal results in as the required result.

Limbajul de programare folosit: cpp14

Cod:

void inOrder(Node *root) {
if(root == NULL){
        return;
    }
    inOrder(root->left);
    printf("%d ", root->data);
    inOrder(root->right);
}

Scor obtinut: 1.0

Submission ID: 464652827

Link challenge: https://www.hackerrank.com/challenges/tree-inorder-traversal/problem

Tree: Inorder Traversal