105. Construct Binary Tree from Preorder and Inorder Traversal

标签：sum   exist   duplicate   const   ica   str   binary   order   win   

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

105. Construct Binary Tree from Preorder and Inorder Traversal

标签：sum   exist   duplicate   const   ica   str   binary   order   win   

原文地址：https://www.cnblogs.com/tobeabetterpig/p/9500966.html