95. 不同的二叉搜索树 II

/**
 * 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*> generateTrees(int start, int end) {
	 vector<TreeNode*> res;
	 if (start > end) {
		 res.push_back(NULL);
		 return res;
	 }
	 for (int i = start; i <= end; ++i) {
		 vector<TreeNode*> leftTrees = generateTrees(start, i - 1);
		 vector<TreeNode*> rightTrees = generateTrees(i + 1,end);
		 for (int l = 0; l < leftTrees.size(); ++l) {
			 for (int r = 0; r < rightTrees.size(); ++r) {
                 TreeNode* root = new TreeNode(i);
				 root->left = leftTrees[l];
				 root->right = rightTrees[r];
				 res.push_back(root);
			 }
		 }
	 }
	 return res;
 }
vector<TreeNode*> generateTrees(int n) {
	vector<TreeNode*> res;
    if(n==0) return res;
	res=generateTrees(1, n);
	return res;
}
};