Awesome Logic Python3
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:90%\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:80%\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:\n        if not inorder or not postorder:\n            return None\n        root=TreeNode(postorder[-1])\n        index=inorder.index(postorder[-1])\n        root.left=self.buildTree(inorder[:index],postorder[:index])\n        root.right=self.buildTree(inorder[index+1:],postorder[index:-1])\n        return root\n    #please upvote me it would encourage me alot\n\n```
['Python3']