Skip to content

Files

Latest commit

21f262e · May 16, 2019

History

History
19 lines (14 loc) · 384 Bytes

construct-binary-tree-from-preorder-and-inorder-traversal.md

File metadata and controls

19 lines (14 loc) · 384 Bytes

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