LeetCode 108：Convert Sorted Array to Binary Search Tree

forever_zzx

于 2019-02-13 19:45:00 发布

阅读量137

点赞数

分类专栏：算法 python 文章标签： LeetCode

本文链接：https://blog.csdn.net/forever_zzx/article/details/87202324

版权

算法同时被 2 个专栏收录

48 篇文章

订阅专栏

python

46 篇文章

订阅专栏

本文介绍了一种将已排序的数组转换为平衡二叉搜索树的方法，通过递归地选取数组中间元素作为根节点，确保了树的高度平衡，从而实现了高效的查找、插入和删除操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Problem can be seen in Convert Sorted Array to Binary Search Tree，the analysis is shown in the following.
A given array named as nums (like [-10,-3,0,5,9]) is sorted in ascending order.
constructing procedure:
root, array[0:5], mid = (len(nums)-1)//2=2
     left, array[0:2], mid=0
          left, array=null
          right, array=array[1:2], mid=1
               left, array=null
               right, array=null
     right, array[3:5], mid=3
          left, array=null
          right, array[4:5], mid=4
               left, array=null
               right, array=null
Using recursion method can implements the constructing procedure above.

class Solution:
    def sortedArrayToBST(self, nums: 'List[int]') -> 'TreeNode':
        
        if len(nums) == 0 or not nums:
            return None
        mid = (len(nums)-1)//2
        root = TreeNode(nums[mid])
        root.left = self.sortedArrayToBST(nums[:mid])
        root.right = self.sortedArrayToBST(nums[mid+1:])
        return root