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/0530.二叉搜索树的最小绝对差.md Normal file → Executable file
View File

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