# Problem Definition

## Description

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

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

Example:

```plaintext
Input:
        Inorder : [2, 1, 3]
        Postorder : [2, 3, 1]

Return:
            1
           / \
          2   3
```

## Notes

1. [LeetCode discussion](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/discuss/34782/My-recursive-Java-code-with-O(n)-time-and-O(n)-space)
1. [YT - Easy Engineering Classes - Construction of Binary Tree from PostOrder and InOrder Traversal](https://www.youtube.com/watch?v=IVlCn-DNO5k)
1. [YT - Yusuf Shakeel - Reconstruct Binary Tree from Inorder and Postorder result](https://www.youtube.com/watch?v=k2dvEJoHVEM)
1. [Geeks for Geeks post](https://www.geeksforgeeks.org/construct-a-binary-tree-from-postorder-and-inorder/)