New update is available. Click here to update.

Topics

For a given Binary Tree of integers, print the post-order traversal.

```
The postorder traversal for the given binary tree will be 40 50 20 30 10
```

Detailed explanation

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

```
1 2 3 4 5 6 7 -1 -1 -1 -1 -1 -1 -1 -1
```

```
4 5 2 6 7 3 1
```

```
5 6 10 2 3 -1 -1 -1 -1 -1 9 -1 -1
```

```
2 9 3 6 10 5
```