class Solution: def build(self, l1, r1, l2, r2, pre, med): if l1 > r1 or l2 > r2: return None inRoot = med.index(pre[l1]) root = TreeNode(pre[l1]) left = inRoot - l2 root.left = self.build(l1+1, l1+left, l2, inRoot - 1, pre, med...