106. Construct Binary Tree from Inorder and Postorder Traversal
Questioin Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. For example, given inorder = [9,3,15,20,7]…