题目 解法: inorder得到排序数组 divide and conquer简历平衡二叉搜索树 class Solution: def balanceBST(self, root: TreeNode) -> TreeNode: def inorder(node): if not node: return inorder(node.left) order.append(node) inorder(node.right) def