CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-08-30 05:22:44 +08:00
parent 34d8dfd075
commit 8843a93605
3 changed files with 118 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
chapter_divide_and_conquer/build_binary_tree_problem.md
View File

@@ -433,9 +433,9 @@ status: new
每个递归函数内的前序遍历 `preorder` 和中序遍历 `inorder` 的划分结果如图 12-9 所示。
![built_tree_overall](build_binary_tree_problem.assets/built_tree_overall.png)
![每个递归函数中的划分结果](build_binary_tree_problem.assets/built_tree_overall.png)
<p align="center"> 图 12-9 &nbsp; built_tree_overall </p>
<p align="center"> 图 12-9 &nbsp; 每个递归函数中的划分结果 </p>
设树的节点数量为 $n$ ，初始化每一个节点（执行一个递归函数 `dfs()` ）使用 $O(1)$ 时间。**因此总体时间复杂度为 $O(n)$** 。