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:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0530.二叉搜索树的最小绝对差.md
View File

@@ -13,7 +13,7 @@
示例：
![530二叉搜索树的最小绝对差](https://code-thinking-1253855093.file.myqcloud.com/pics/20201014223400123.png)
![530二叉搜索树的最小绝对差](https://file.kamacoder.com/pics/20201014223400123.png)
提示：树中至少有 2 个节点。
@@ -70,7 +70,7 @@ public:
如图：
![530.二叉搜索树的最小绝对差](https://code-thinking-1253855093.file.myqcloud.com/pics/20210204153247458.png)
![530.二叉搜索树的最小绝对差](https://file.kamacoder.com/pics/20210204153247458.png)
一些同学不知道在递归中如何记录前一个节点的指针，其实实现起来是很简单的，大家只要看过一次，写过一次，就掌握了。