struct TreeNode* create()
{
struct TreeNode* t = malloc(sizeof(struct TreeNode));
t = NULL;
return t;
}
struct TreeNode* insert(int* nums, int left, int right)
{
int mid = (left + right) / 2;
struct TreeNode* new_node = malloc(sizeof(struct TreeNode));
if (left <= right)
{
new_node->val = nums[mid];
new_node->left = insert(nums, left, mid - 1);
new_node->right = insert(nums, mid + 1, right);
}
return NULL;
}
struct TreeNode* sortedArrayToBST(int* nums, int numsSize)
{
struct TreeNode* t = create();
t = insert(nums, 0, numsSize - 1);
return t;
}
108. 将有序数组转换为二叉搜索树
最新推荐文章于 2023-12-11 19:54:24 发布