Convert Sorted Array to Binary Search Tree - LeetCode

Convert Sorted Array to Binary Search Tree - LeetCode

题目：

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

分析:

banlanced BST ：平衡二叉树，它是一 棵空树或它的左右两个子树的高度差的绝对值不超过1，并且左右两个子树都是一棵平衡二叉树。 所以我们利用二分法，即不断的二分给定的列表，用mid作为当前过程生成的结点值。

代码：

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

class Solution:
    # @param num, a list of integers
    # @return a tree node
    def sortedArrayToBST(self, num):
        if not num:
            return
        middle = len(num)/2
        trees =  TreeNode(num[middle])
        trees.left = self.sortedArrayToBST(num[:middle])
        trees.right = self.sortedArrayToBST(num[middle+1:])
        return trees