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

105. 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]