# Preorder Binary Tree

Posted: 3 Aug, 2017

Difficulty: Easy

#### You are given the root node of a binary tree.Print its preorder traversal.

##### Input Format:

```
The first and the only line of input will contain the node data, all separated by a single space. Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.
```

##### Output Format:

```
The only line of output prints the preorder traversal of the given binary tree.
```

##### Constraints:

```
1 <= N <= 10^6
Where N is the total number of nodes in the binary tree.
Time Limit: 1 sec
```

Working on approaches!

Meanwhile, please head to Code Editor and try the problem there.

Meanwhile, please head to Code Editor and try the problem there.

SIMILAR PROBLEMS

# Balanced Binary Tree

Posted: 1 Jul, 2021

Difficulty: Moderate

# Postorder Traversal

Posted: 22 Jul, 2021

Difficulty: Easy

# Preorder Traversal

Posted: 22 Jul, 2021

Difficulty: Easy

# Maximum Sum BST

Posted: 27 Jul, 2021

Difficulty: Hard

# Vertical Sum in BST

Posted: 27 Jul, 2021

Difficulty: Moderate