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/0108.将有序数组转换为二叉搜索树.md
View File

@@ -16,7 +16,7 @@
示例:
![108.将有序数组转换为二叉搜索树](https://code-thinking-1253855093.file.myqcloud.com/pics/20201022164420763.png)
![108.将有序数组转换为二叉搜索树](https://file.kamacoder.com/pics/20201022164420763.png)
## 算法公开课
@@ -40,7 +40,7 @@
例如 有序数组[-10，-3，0，5，9] 就可以构造成这样的二叉搜索树，如图。
![](https://code-thinking-1253855093.file.myqcloud.com/pics/20220930173553.png)
![](https://file.kamacoder.com/pics/20220930173553.png)
上图中，是符合二叉搜索树的特性吧，如果要这么做的话，是不是本题意义就不大了，所以才强调是平衡二叉搜索树。