LeetCode之Insert into a Binary Search Tree（Kotlin）

最新推荐文章于 2019-04-21 18:01:24 发布

糕冷羊

最新推荐文章于 2019-04-21 18:01:24 发布

阅读量221

点赞数

分类专栏： Leetcode Kotlin 文章标签： leetcode kotlin

本文链接：https://blog.youkuaiyun.com/wanglikun7342/article/details/83215656

版权

Leetcode 同时被 2 个专栏收录

35 篇文章

订阅专栏

Kotlin

23 篇文章

订阅专栏

本文详细介绍了如何在二叉搜索树中插入一个新值，通过递归算法保持树的搜索特性。提供了具体的代码实现，展示了插入过程及可能的树结构变化。

摘要生成于 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:

         4
       /   \
      2     7
     / \   /
    1   3 5
This tree is also valid:

         5
       /   \
      2     7
     / \   
    1   3
         \
          4

方法：
二叉搜索树的递归，重点在于理顺递归调用逻辑，具体实现参考代码。

具体实现：

class InsertIntoABinarySearchTree {

    // Definition for a binary tree node.
    class TreeNode(var `val`: Int = 0) {
        var left: TreeNode? = null
        var right: TreeNode? = null
    }

    fun insertIntoBST(root: TreeNode?, `val`: Int): TreeNode? {
        if (root == null) {
            return root
        }
        if (`val` < root.`val`) {
            if (root.left == null) {
                root.left = TreeNode(`val`)
            } else {
                insertIntoBST(root.left, `val`)
            }
        } else {
            if (root.right == null) {
                root.right = TreeNode(`val`)
            } else {
                insertIntoBST(root.right, `val`)
            }
        }
        return root
    }
}

fun main(args: Array<String>) {

}

有问题随时沟通

具体代码实现可以参考Github