LeetCode //C - 108. Convert Sorted Array to Binary Search Tree-CSDN博客

本文链接：https://blog.csdn.net/navicheung/article/details/133847905

本文介绍了如何将已排序的整数数组转换为高度平衡的二叉搜索树（BST），通过递归地分割数组并选择中间元素作为新节点，然后构建左右子树。方法使用了辅助函数和递归策略。

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

108. Convert Sorted Array to Binary Search Tree

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

Example 1:

在这里插入图片描述

Input: nums = [-10,-3,0,5,9]
Output: [0,-3,9,-10,null,5]
Explanation: [0,-10,5,null,-3,null,9] is also accepted:

在这里插入图片描述

Example 2:

在这里插入图片描述

Input: nums = [1,3]
Output: [3,1]
Explanation: [1,null,3] and [3,1] are both height-balanced BSTs.

Constraints:

1 <= nums.length <= $10^4$
- $10^4 <= nums[i] <= 10^4$
nums is sorted in a strictly increasing order.

From: LeetCode
Link: 108. Convert Sorted Array to Binary Search Tree

Solution:

Ideas：

The helper function is used to convert a subarray defined by the start and end indices into a subtree of the BST.
If start > end, it means the subarray is empty and we return NULL.
We calculate the middle index of the subarray and use the element at that index to create a new tree node.
The left and right children of this new node are recursively determined by the left and right halves of the subarray.
The sortedArrayToBST function is just an entry point that calls the helper function using the entire array as the initial subarray.

Code:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* helper(int* nums, int start, int end) {
    if (start > end) {
        return NULL;
    }
    
    int mid = start + (end - start) / 2;
    struct TreeNode* node = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    node->val = nums[mid];
    node->left = helper(nums, start, mid - 1);
    node->right = helper(nums, mid + 1, end);
    
    return node;
}

struct TreeNode* sortedArrayToBST(int* nums, int numsSize){
    return helper(nums, 0, numsSize - 1);
}