ConstructBinaryTreefromInorderandPostorderTraversal

O(n^2) solution. simpler to understand. I'll try to find the O(n)
solution later.