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:
bqlin
2021-12-25 12:24:02 +08:00
parent 96f70a46a4
commit 898330147c
29 changed files with 51 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0538.把二叉搜索树转换为累加树.md
View File

@@ -47,7 +47,7 @@
一看到累加树，相信很多小伙伴都会疑惑：如何累加？遇到一个节点，然后在遍历其他节点累加？怎么一想这么麻烦呢。
然后再发现这是一颗二叉搜索树，二叉搜索树啊，这是有序的啊。
然后再发现这是一棵二叉搜索树，二叉搜索树啊，这是有序的啊。
那么有序的元素如果求累加呢？