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

版权声明：本文为博主原创文章，请尊重原创，转载请注明原文地址和作者信息！ https://blog.csdn.net/zzc15806/article/details/81267637

# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

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