github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/0106.从中序与后序遍历序列构造二叉树.md
View File

@@ -25,7 +25,7 @@
* 后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树：
![106. 从中序与后序遍历序列构造二叉树1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210203154316774.png)
![106. 从中序与后序遍历序列构造二叉树1](https://file.kamacoder.com/pics/20210203154316774.png)
## 算法公开课
@@ -40,7 +40,7 @@
流程如图：
![106.从中序与后序遍历序列构造二叉树](https://code-thinking-1253855093.file.myqcloud.com/pics/20210203154249860.png)
![106.从中序与后序遍历序列构造二叉树](https://file.kamacoder.com/pics/20210203154249860.png)
那么代码应该怎么写呢？
@@ -411,7 +411,7 @@ public:
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：
![105. 从前序与中序遍历序列构造二叉树](https://code-thinking-1253855093.file.myqcloud.com/pics/20210203154626672.png)
![105. 从前序与中序遍历序列构造二叉树](https://file.kamacoder.com/pics/20210203154626672.png)
### 思路
@@ -554,7 +554,7 @@ public:
举一个例子：
![106.从中序与后序遍历序列构造二叉树2](https://code-thinking-1253855093.file.myqcloud.com/pics/20210203154720326.png)
![106.从中序与后序遍历序列构造二叉树2](https://file.kamacoder.com/pics/20210203154720326.png)
tree1 的前序遍历是[1 2 3]， 后序遍历是[3 2 1]。