【leetcode 二叉树 C++】894. All Possible Full Binary Trees

最新推荐文章于 2024-09-19 06:03:14 发布

笨比master

最新推荐文章于 2024-09-19 06:03:14 发布

阅读量58

点赞数

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

本文链接：https://blog.csdn.net/m0_37454852/article/details/113189099

版权

leetcode 专栏收录该内容

288 篇文章 0 订阅

订阅专栏

894. All Possible Full Binary Trees

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<TreeNode*> allPossibleFBT(int N) {
        if(N % 2 == 0) return {};
        if(N == 1) return {new TreeNode(0)};
        vector<TreeNode*> V;
        N--;
        for(int ii = 1; ii <= N; ii += 2) {
            auto leftV = allPossibleFBT(ii), rightV = allPossibleFBT(N - ii);
            for(auto a : leftV) {
                for(auto b : rightV) {
                    TreeNode* root = new TreeNode(0);
                    root->left = a;
                    root->right = b;
                    V.push_back(root);
                }
            }
        }
        return V;
    }
};