【LeetCode】108. Convert Sorted Array to Balanced Binary Search Tree

解法：

    分治法（Divide and conquer），推荐解法和我的心路思路相同，不同之处在于，递归时不传递新的数组，而是传递start和end。更为节省空间开销。

Python源码：

Runtime: 44 ms, faster than 99.24% of Python online submissions for Convert Sorted Array to Binary Search Tree.

Memory Usage: 16 MB, less than 54.54% of Python online submissions for Convert Sorted Array to Binary Search Tree.

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def sortedArrayToBST(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        return self.get_bt_from_array(nums, 0, len(nums) - 1)
        
    def get_bt_from_array(self, nums, start, end):
        if start > end:
            return None
        mid = (start + end) // 2
        node = TreeNode(nums[mid])
        node.left = self.get_bt_from_array(nums, start, mid-1)
        node.right = self.get_bt_from_array(nums, mid+1, end)
        return node

我的心路：

    因为array固定，不需要考虑动态添加删除，可以直接根据平衡二叉树的特点，递归地取array的中位数做父节点，array左侧的中位数做左子节点，array右侧的中位数做右子节点。时间复杂度，空间复杂度。

Runtime: 56 ms, faster than 64.06% of Python online submissions for Convert Sorted Array to Binary Search Tree.

Memory Usage: 15.9 MB, less than 90.91% of Python online submissions for Convert Sorted Array to Binary Search Tree.

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def sortedArrayToBST(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        return self.get_bt_from_array(nums)
        
    def get_bt_from_array(self, nums):
        if not nums:
            return None
        idx = len(nums) // 2
        new_node = TreeNode(nums[idx])
        new_node.left = self.get_bt_from_array(nums[:idx])
        new_node.right = self.get_bt_from_array(nums[idx+1:])
        return new_node