# Problem Definition

## Description

Given pre-order and in-order traversal of a tree, construct the binary tree.

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

Example:

```plaintext
Input:
        Pre-order : [1, 2, 3]
        In-order  : [2, 1, 3]

Return:
            1
           / \
          2   3
```

## Notes

1. [Geeks for Geeks post](https://www.geeksforgeeks.org/construct-tree-from-given-inorder-and-preorder-traversal/)
1. [ProgramCreek post](https://www.programcreek.com/2014/06/leetcode-construct-binary-tree-from-preorder-and-inorder-traversal-java/)