xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-07 21:24:18 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-08-19 19:21:18 +08:00
parent 97c532b228
commit 71c7786f51
22 changed files with 49 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_divide_and_conquer/build_binary_tree_problem.md
+1
View File
@@ -49,6 +49,7 @@ status: new
- 将当前树在 `inorder` 中的索引区间记为 $[l, r]$ 。
如下表所示，通过以上变量即可表示根节点在 `preorder` 中的索引，以及子树在 `inorder` 中的索引区间。
<p align="center"> 表：根节点和子树在前序和中序遍历中的索引 </p>
<div class="center-table" markdown>