力扣95不同的二叉搜索树

自上向下递归下去找到所有的树比较容易，难得是如何如何从下往上返回来把每一棵树都打印出来，

class Solution {
public:
    vector<TreeNode*> generateTrees(int n) 
    {
        vector<TreeNode*>ans ;
        if (n == 0) 
        {
            return ans;
        }
        return getAns(1, n);
    }

private:
    vector<TreeNode*> getAns(int start, int end) 
    { 
        vector<TreeNode*> ans;
        if (start > end) 
        {
            ans.push_back(NULL);
            return ans;
        }
        if (start == end) {
            TreeNode *tree = new TreeNode(start);
            ans.push_back(tree);
            return ans;
        }
        for (int i = start; i <= end; i++) 
        {
            vector<TreeNode*> leftTrees = getAns(start, i - 1);
            vector<TreeNode*> rightTrees = getAns(i + 1, end);
            for (vector<TreeNode*>::iterator leftTree=leftTrees.begin();leftTree!=leftTrees.end();leftTree++) 
            {
                for (vector<TreeNode*>::iterator rightTree=rightTrees.begin();rightTree!=rightTrees.end();rightTree++) 
                {
                    TreeNode *root = new TreeNode(i);
                    root->left =*leftTree;
                    root->right = *rightTree;
                    ans.push_back(root);
                }
            }
        }
        return ans;
    }
};

代码分析，getAns处理从start到end的序列，以i为根划分成两份，1到i-1和i+1到n。再递归找到对两个序列的getAns处理，得到左子树和右子树，两个子树在i的循环中也会出现多种，这些不同情况的子树被添加到ans中返回来，分别总两个子树集中分别取一个，与根i组成一个树，添加到这一层递归的ans，取完所有的组合情况，再返回上一层递归，构成上一层的左或者右子树