Leetcode 108. Convert Sorted Array to Binary Search Tree

小白菜又菜

于 2021-06-18 19:54:32 发布

阅读量122

点赞数

分类专栏： Leetcode 解题报告

本文链接：https://blog.csdn.net/mobius_strip/article/details/118032652

版权

解题报告同时被 2 个专栏收录

1392 篇文章

订阅专栏

Leetcode

168 篇文章

订阅专栏

本文介绍了一种将已排序的整数数组转换为高度平衡二叉搜索树的方法。平衡二叉搜索树是一种特殊的二叉树，其每个节点的两个子树的深度相差不超过一。通过递归方式，在数组中间位置选取元素作为根节点，并递归构造左右子树。

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

Problem

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.

Algorithm

Recursion. Divide the tree into two sub-trees in the middle.

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
        numsL = len(nums)
        if not numsL:
            return []
        
        def dfs(L, R):
            if L > R:
                return None
            M = (L + R) // 2
            L = dfs(L, M-1)
            R = dfs(M+1, R)
            return TreeNode(nums[M], L, R)
        
        return dfs(0, numsL-1)