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 {};
        int n=(N+1)/2;
        vector<TreeNode*> ans;
        if(n==1){
            ans.push_back(new TreeNode(0));
            return ans;
        }
        for(int i=1;i<=n-1;++i){
            vector<TreeNode*>  left=allPossibleFBT(2*i-1);
            vector<TreeNode*> right=allPossibleFBT(2*(n-i)-1);
            for(auto& l : left){
                for(auto& r: right){
                    TreeNode* root=new TreeNode(0);
                    root->left=l;
                    root->right=r;
                    ans.push_back(root);
                }
            }
        }
        return ans;
    }
};