algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-24 18:55:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-01-12 21:13:51 +08:00
parent 97f3be5bc8
commit 10c61fd528
18 changed files with 45 additions and 75 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_divide_and_conquer/build_binary_tree_problem.md
View File

@ -6,7 +6,7 @@ comments: true
!!! question
给定一棵二叉树的前序遍历 `preorder` 和中序遍历 `inorder` ，请从中构建二叉树，返回二叉树的根节点。假设二叉树中没有值重复的节点，如图 12-5 所示。
给定一棵二叉树的前序遍历 `preorder` 和中序遍历 `inorder` ，请从中构建二叉树，返回二叉树的根节点。假设二叉树中没有值重复的节点（如图 12-5 所示）。
![构建二叉树的示例数据](build_binary_tree_problem.assets/build_tree_example.png){ class="animation-figure" }