面试题 04.02. 最小高度树

最新推荐文章于 2021-02-21 11:04:46 发布

<-->

最新推荐文章于 2021-02-21 11:04:46 发布

阅读量110

点赞数

分类专栏：算法文章标签： leetcode 算法

本文链接：https://blog.csdn.net/qq_34276797/article/details/107839297

版权

算法专栏收录该内容

21 篇文章 0 订阅

订阅专栏

面试题 04.02. 最小高度树

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

struct TreeNode* buildTree(int* nums, int l, int r)
{
    if(l>r) return NULL;  
    
    struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    int mid = (r+l)/2;
    root->val = nums[mid];
    root->left = buildTree(nums, l, mid-1);
    root->right = buildTree(nums, mid+1, r);
    return root;
}

struct TreeNode* sortedArrayToBST(int* nums, int numsSize){
    if(nums==NULL || numsSize<1) return NULL;
    int l = 0, r = numsSize-1;
    return buildTree(nums, l, r);
}