0701-insert-into-a-binary-search-tree.adoc

701. Insert into a Binary Search Tree

{leetcode}/problems/insert-into-a-binary-search-tree/[LeetCode - 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

思路分析

二叉搜索树的特性：左中右是有序的。如果插入的值比当前节点小，那么就在左子树上找，如果最节点为空，直接插入；否则就不断 cur = cur.left。如果插入的值更大，亦是如此。

link:{sourcedir}/_0701_InsertIntoABinarySearchTree.java[role=include]

参考资料

1. 701. 二叉搜索树中的插入操作 - 官方题解

2. 701. 二叉搜索树中的插入操作 - ACM 选手图解 LeetCode 二叉搜索树中的插入操作（递归 + 非递归） — 整理了一些资料，可以看看。