CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新图片链接

Browse Source
This commit is contained in:
kama
2025-05-19 17:11:04 +08:00
parent b489cb69b5
commit ce6e658d14
315 changed files with 2499 additions and 1729 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0450.删除二叉搜索树中的节点.md Normal file → Executable file
View File

@@ -20,7 +20,7 @@
示例:
![450.删除二叉搜索树中的节点](https://file.kamacoder.com/pics/20201020171048265.png)
![450.删除二叉搜索树中的节点](https://file1.kamacoder.com/i/algo/20201020171048265.png)
## 算法公开课
@@ -67,7 +67,7 @@ if (root == nullptr) return root;
第五种情况有点难以理解，看下面动画：
![450.删除二叉搜索树中的节点](https://code-thinking.cdn.bcebos.com/gifs/450.%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.gif)
![450.删除二叉搜索树中的节点](https://file1.kamacoder.com/i/algo/450.%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.gif)
动画中的二叉搜索树中，删除元素7， 那么删除节点（元素7）的左孩子就是5，删除节点（元素7）的右子树的最左面节点是元素8。