Cerinta completa

Complete the function in the editor below, which has parameter: a pointer to the root of a binary tree. It must print the values in the tree’s preorder traversal as a single line of space-separated values.

Input Format

Our test code passes the root node of a binary tree to the preOrder function.

Constraints

Nodes in the tree

Output Format

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

Sample Input

     1
      \
       2
        \
         5
        /  \
       3    6
        \
         4

Sample Output

1 2 5 3 4 6

Explanation

The preorder traversal of the binary tree is printed.

Limbajul de programare folosit: cpp14

Cod:

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

Scor obtinut: 1.0

Submission ID: 464652809

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

Tree: Preorder Traversal