【leetcode】-701. 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

Constraints:

The number of nodes in the given tree will be between 0 and 10^4.
Each node will have a unique integer value from 0 to -10^8, inclusive.
-10^8 <= val <= 10^8
It’s guaranteed that val does not exist in the original BST.

递归

对BST问题都可以根据其根结点值大于左子结点值，小于右子结点值的特性进行递归操作。
当然递归都是从顶到下进行计算的，树的顶就是根结点，所以首先要判断根结点情况；然后递归判断左右子结点。

python 代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode:
        if not root:
            return TreeNode(val)
        if root.val<val:
            root.right = self.insertIntoBST(root.right,val)
        if root.val>val:
            root.left = self.insertIntoBST(root.left,val)
        return root