Insert into a Binary Search Tree

Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

Note that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.

For example, 

Given the tree:
        4
       / \
      2   7
     / \
    1   3
And the value to insert: 5

You can return this binary search tree:

         4
       /   \
      2     7
     / \   /
    1   3 5

This tree is also valid:

         5
       /   \
      2     7
     / \   
    1   3
         \
          4

 

题目理解：

给定一棵二叉搜索树，和一个目标值，将给定值插入到二叉搜索树当中

解题思路：

使用一个指针指向根节点，如果目标值小于当前节点的值，指针指向自己的左孩子，否则指向自己的右孩子。

直到当前需要指向的孩子节点为空，