Insert into a Binary Search Tree

Problem: https://leetcode.com/problems/insert-into-a-binary-search-tree/description/

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

Best is to traverse down the tree using the BST characteristic ("binary") which should take Log(N). When you hit a node for which the corresponding right or left node (based on "val") is null, insert the new node right there. Runs in O(Log(N)). Code is below, thanks, Boris.

public class Solution
{
 public TreeNode InsertIntoBST(TreeNode root, int val)
 {
  _InsertIntoBST(root, val);
  return root;
 }

 private void _InsertIntoBST(TreeNode root, int val)
 {
  if (root == null) return;
  if (val < root.val)
  {
   if (root.left == null) root.left = new TreeNode(val);
   else _InsertIntoBST(root.left, val);
  }
  else
  {
   if (root.right == null) root.right = new TreeNode(val);
   else _InsertIntoBST(root.right, val);
  }
 }
}