convert-sorted-array-to-binary-search-tree.py

# Runtime: 88 ms


class Solution(object):
    def sortedArrayToBST(self, nums):
        if len(nums) == 0:
            return None

        mid = len(nums) / 2
        root = TreeNode(nums[mid])
        root.left = self.sortedArrayToBST(nums[:mid])
        root.right = self.sortedArrayToBST(nums[mid + 1:])
        return root