Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree.

Assume that there are no duplicate values.

Example

```
Insert 6:
2 2
/ \ / \
1 4 --> 1 4
/ / \
3 3 6
```

Recursive solution: