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

Prepare 1.0.0 release (#1044)

Browse Source 
* Update the book with the thrid revised edition

* Fix a typo

* Update the contributors' information

* Update the mindmap

* Update the version number
This commit is contained in:
Yudong Jin
2024-01-14 03:16:20 +08:00
committed by GitHub
parent b9ae4ffe9a
commit f6976978dd
33 changed files with 50 additions and 49 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

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