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
2023-03-10 14:02:32 +08:00
parent 2a9b627a90
commit 17cb4b45c7
134 changed files with 1169 additions and 829 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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