class Solution(object):
def sortedListToBST(self, head):
"""
:type head: ListNode
:rtype: TreeNode
"""
nums=[]
while head:
nums.append(head.val)
head=head.next
return self.sortedArrayToBST(nums)
def sortedArrayToBST(self,nums):
if nums==[]:
return None
mid=len(nums)>>1
root=TreeNode(nums[mid])
root.left=self.sortedArrayToBST(nums[:mid])
root.right=self.sortedArrayToBST(nums[mid+1:])
return root
python leetcode 109. Convert Sorted List to Binary Search Tree
最新推荐文章于 2022-11-04 06:21:23 发布