leetcode-106-从中序和后序遍历构造二叉树

题目描述：   方法一：O(n) O(n) class Solution: def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode: assert len(inorder)==len(postorder) if len(inorder)==0:

>>阅读原文<<