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

en: fix picture file name (#1764)

Browse Source
This commit is contained in:
Seven Du
2025-06-12 20:46:31 +08:00
committed by GitHub
parent db64108e5d
commit 5a4aa8c554
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
en/docs/chapter_divide_and_conquer/build_binary_tree_problem.md
View File

@@ -29,7 +29,7 @@ Using the data from the preceding figure, we can follow the steps shown in the n
2. Find the index of the root node 3 in the `inorder` sequence, and use this index to split `inorder` into `[ 9 | 3 ｜ 1 2 7 ]`.
3. According to the split of the `inorder` sequence, it is straightforward to determine that the left and right subtrees contain 1 and 3 nodes, respectively, so we can split the `preorder` sequence into `[ 3 | 9 | 2 1 7 ]` accordingly.
![Dividing the subtrees in pre-order and in-order traversals](build_binary_tree_problem.assets/build_tree_pre-order_in-order_division.png)
![Dividing the subtrees in pre-order and in-order traversals](build_binary_tree_problem.assets/build_tree_preorder_inorder_division.png)
### Describing subtree ranges based on variables