leetcode-450-Delete Node in a BST

最新推荐文章于 2022-08-17 08:15:18 发布

原创最新推荐文章于 2022-08-17 08:15:18 发布 · 117 阅读

CC 4.0 BY-SA版权

185 篇文章

订阅专栏

本文探讨了在二叉搜索树(BST)中删除节点的三种情况：仅左子树、仅右子树和同时拥有左右子树。重点介绍了当节点同时拥有两个子树时的处理方法，即找到右子树的最小值节点，用其替换待删除节点。

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

Error:

do not know how to do. We can have 3 situation: When we find the key in BST 1) only has left subtree, 2) only have right subtree, 3) both.
In 1) and 2), we can just add such subtree to the root, but in 3), we should first its min. val in the right subtree, then delete the key root and replace min. to the root.