Construct Binary Tree from Inorder & Postorder (#106)

Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.

Company Tags: Amazon

Core Concept: Tree, Recursion

Solve on LeetCode