class Solution(object):
def sortedArrayToBST(self, nums):
"""
:type nums: List[int]
:rtype: TreeNode
"""
if not nums:
return None
def rec(nums):
mid=len(nums)/2
root=TreeNode(-1)
root.val=nums[mid]
if mid>0:
root.left=rec(nums[:mid])
if mid<len(nums)-1:
root.right=rec(nums[mid+1:])
return root
return rec(nums)
leetcode108. 将有序数组转换为二叉搜索树
最新推荐文章于 2024-10-17 19:06:39 发布