# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
if not nums:
return None
start=0
end=len(nums)-1
return self.soredp(nums,start,end)
def soredp(self,nums,start,end):
if start>end:
return None
mid=int((start+end)/2)
root=TreeNode(nums[mid])
root.left=self.soredp(nums,start,mid-1)
root.right=self.soredp(nums,mid+1,end)
return root