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

Fix some figures.

Browse Source
This commit is contained in:
krahets
2023-08-30 02:52:50 +08:00
parent d387d9d41d
commit db7975d51f
11 changed files with 9 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_divide_and_conquer/build_binary_tree_problem.md
+3 -2
View File
@@ -182,8 +182,9 @@
=== "<9>"
![built_tree_step9](build_binary_tree_problem.assets/built_tree_step9.png)
=== "<10>"
![built_tree_step10](build_binary_tree_problem.assets/built_tree_step10.png)
每个递归函数内的前序遍历 `preorder` 和中序遍历 `inorder` 的划分结果如下图所示。
![每个递归函数中的划分结果](build_binary_tree_problem.assets/built_tree_overall.png)
设树的节点数量为 $n$ ，初始化每一个节点（执行一个递归函数 `dfs()` ）使用 $O(1)$ 时间。**因此总体时间复杂度为 $O(n)$** 。