701. Insert into a Binary Search Tree

最新推荐文章于 2020-05-22 07:20:18 发布

多多趣

最新推荐文章于 2020-05-22 07:20:18 发布

阅读量221

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/excellentlizhensbfhw/article/details/82529091

LeetCode 专栏收录该内容

548 篇文章

订阅专栏

本文详细介绍了如何在二叉搜索树中插入一个新值，包括递归算法的实现过程。通过实例演示了插入后的二叉搜索树可能的形态变化。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

This tree is also valid:

二叉树插入，程序如下所示：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if (root == null){
            root = new TreeNode(val);
            return root;
        }
        if (root.val > val){
            root.left = insertIntoBST(root.left, val);
        }
        else {
            root.right = insertIntoBST(root.right, val);
        }
        return root;
    }
}