leetcode(108)：Convert Sorted Array to Binary Search Tree

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

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

题目分析，在这个题目中，我们需要明确搜索二叉树的性质，需要明白平衡二叉树的性质，结合2者来进行考虑。对于给定的是从小到大排序的数组，我们对于平衡搜索二叉树而言，需要确定根节点的位置，然后确定根节点以及左右子节点的位置，然后依次递归来求解问题。

python代码：

# 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
        """
        if len(nums) == 0:
            return None
        loc = int(len(nums)/2)
        node = TreeNode(nums[loc])
        node.left = self.sortedArrayToBST(nums[0:loc:1])
        node.right = self.sortedArrayToBST(nums[loc+1::1])
        return node

好吧，那现在看一下大佬们所写的程序，找找不足。

# 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
    # 12:37
    def sortedArrayToBST(self, num):
        if not num:
            return None

        mid = len(num) // 2

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

        return root

这一次是跟大佬们的思想是完全融合的哈，，哈哈，有点开心。
但同时也暴露了自己有一个知识点是不清楚的。
loc = len(num) / 2是直接进行了向下取整，不需要再加int()操作了。