NC11 将升序数组转化为平衡二叉搜索树

class Solution:
    def sortedArrayToBST(self, num: List[int]) -> TreeNode:
        # write code here
        # 二分+迭代
        if num == None:
            return None
        n = len(num)
        if n == 0:
            return None

        mid = n // 2
        root = TreeNode(num[mid])
        if n == 1:
            return root

        root.left = self.sortedArrayToBST(num[:mid])
        root.right = self.sortedArrayToBST(num[mid+1:])
        return root