Python Easy Code
\t def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n        if len(postorder)==0:\n            return None\n        root=Tr
\t def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n        if len(postorder)==0:\n            return None\n        root=TreeNode(postorder[-1])\n        for i in range(len(inorder)):\n            if postorder[-1]==inorder[i]:\n                break\n        root.left=self.buildTree(inorder[0:i],postorder[0:i])\n        root.right=self.buildTree(inorder[i+1:],postorder[i:-1])\n        return root
['Recursion', 'Python']