We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

- Prepare
- Data Structures
- Trees
- Tree: Preorder Traversal

# Tree: Preorder Traversal

# Tree: Preorder Traversal

- Prepare
- Data Structures
- Trees
- Tree: Preorder Traversal

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.