力扣108. 将有序数组转换为二叉搜索树

 

记录一下自己的思路，做完题目后，发现跟答案一模一样。。。记录了个寂寞

题目：【https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/description/?envType=study-plan-v2&envId=top-interview-150】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

struct TreeNode* body(int* arr, int l, int r)
{
    if (l > r)
        return NULL;

    int index = (l + r) >> 1;

    struct TreeNode* t = (struct TreeNode*)malloc(sizeof(struct TreeNode));

    t->val = arr[index];
    t->left  = body(arr, l, index - 1);
    t->right = body(arr, index + 1, r);
    return t;
}

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