*/
struct TreeNode*good(int*nums,int left,int right)
{
if(left>right)
{
return NULL;
}
struct TreeNode*root=malloc(sizeof(struct TreeNode));
int mid=(left+right)/2;
root->val=nums[mid];
root->left=good(nums,left,mid-1);
root->right=good(nums,mid+1,right);
return root;
}
struct TreeNode* sortedArrayToBST(int* nums, int numsSize){
return good(nums,0,numsSize-1);
}
力扣经典题:最小高度树
最新推荐文章于 2024-10-08 10:36:00 发布