leetCode95不同二叉搜索树2

最新推荐文章于 2024-06-17 19:15:39 发布

youn_hr

最新推荐文章于 2024-06-17 19:15:39 发布

阅读量26

点赞数

分类专栏： leetCode 文章标签：数据结构动态规划

本文链接：https://blog.csdn.net/SIYIY/article/details/131555255

版权

leetCode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

struct TreeNode** buildTree(int start,int end,int *returnSize){
    if(start>end){
        (*returnSize) = 1;
        struct TreeNode ** ret = malloc(sizeof(struct TreeNode*));
        ret[0] = NULL;
        return ret;
    }

    *returnSize = 0;
    struct TreeNode **allTrees = malloc(0);
    for(int i=start;i<=end;i++){
        int lSize;
        struct TreeNode** leftTrees = buildTree(start,i-1,&lSize);
        int rSize;
        struct TreeNode** rightTrees = buildTree(i+1,end,&rSize);

        for(int left=0;left<lSize;left++){
            for(int right=0;right<rSize;right++){
                struct TreeNode* curTree = malloc(sizeof(struct TreeNode));
                curTree->val=i;
                curTree->left=leftTrees[left];
                curTree->right=rightTrees[right];

                (*returnSize)++;
                allTrees = realloc(allTrees,sizeof(struct TreeNode*)*(*returnSize));
                allTrees[(*returnSize)-1]=curTree;
            }
        }
        free(leftTrees);
        free(rightTrees);
    }
    return allTrees;

}


struct TreeNode** generateTrees(int n,int *returnSize){
    if(n==0){
        (*returnSize)=0;
        return NULL;
    }

    return buildTree(1,n,returnSize);
}