0105-construct-binary-tree-from-preorder-and-inorder-traversal.adoc

105. Construct Binary Tree from Preorder and Inorder Traversal

{leetcode}/problems/construct-binary-tree-from-preorder-and-inorder-traversal/[LeetCode - Construct Binary Tree from Preorder and Inorder Traversal^]

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:

You may assume that duplicates do not exist in the tree.

For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]

Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

思路分析

一刷

link:{sourcedir}/_0105_ConstructBinaryTreeFromPreorderAndInorderTraversal.java[role=include]

二刷

link:{sourcedir}/_0105_ConstructBinaryTreeFromPreorderAndInorderTraversal_2.java[role=include]

思考题

迭代构建如何实现？ 参考： 105. 从前序与中序遍历序列构造二叉树。

参考资料

1. 105. 从前序与中序遍历序列构造二叉树 - 分治，清晰图解

2. 105. 从前序与中序遍历序列构造二叉树 - 官方题解

3. 105. 从前序与中序遍历序列构造二叉树 - 分治法