LeetCode--108. Convert Sorted Array to Binary Search Tree(将有序数组转为二叉搜索树)Python

题目：

给定一个有序数组，将这个数组存入平衡的二叉搜索树中。

解题思路：

使用递归。逐个处理根节点的值、左节点和右节点。

代码（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)==1:
            return TreeNode(nums[0])
        elif len(nums)==0:
            return None
        else:
            root = TreeNode(nums[len(nums)/2])
            if len(nums[0:len(nums)/2])==0:
                root.left = None
            else:
                root.left = self.sortedArrayToBST(nums[0:len(nums)/2])
            if len(nums[len(nums)/2+1:])==0:
                root.right = None
            else:
                root.right = self.sortedArrayToBST(nums[len(nums)/2+1:])
            return root