leetcood学习笔记-108-将有序数组转换为二叉搜索树
---恢复内容开始---
题目描述:
方法一:
class Solution(object): def sortedArrayToBST(self, nums): """ :type nums: List[int] :rtype: TreeNode """ if not nums: return None else: mid = len(nums)//2 tn = TreeNode(nums[mid]) nums1 = nums[0:mid] nums2 = nums[mid+1:len(nums)] tn.left = self.sortedArrayToBST(nums1) tn.right = self.sortedArrayToBST(nums2) return tn
---恢复内容结束---