LeetCode 95:Unique Binary Search Trees II

最新推荐文章于 2023-04-14 23:24:50 发布

原创最新推荐文章于 2023-04-14 23:24:50 发布 · 1.9k 阅读

0 ·

CC 4.0 BY-SA版权

C++ 同时被 3 个专栏收录

133 篇文章

订阅专栏

DataStructure&Algorithms

131 篇文章

订阅专栏

LeetCode算法分析

128 篇文章

订阅专栏

本文提供了一种方法来生成所有结构独特的BST（二叉搜索树），对于给定的整数n，生成所有可能的BST，包括示例解释和代码实现。

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.

For example,
Given n = 3, your program should return all 5 unique BST's shown below.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

Subscribe to see which companies asked this question

//递归的方法
class Solution{
public: 
	vector<TreeNode*> generateTrees(int n){
		return generate(1, n);
	}

	vector<TreeNode*> generate(int begin, int end){
		vector<TreeNode*> res;
		if (begin > end)   res.push_back(NULL);
		if (begin == end)  res.push_back(new TreeNode(begin));
		if (begin < end)
		{
			for (int k = begin; k <= end; k++){
				vector<TreeNode*> l = generate(begin, k - 1);
				vector<TreeNode*> r = generate(k + 1, end);
				for (int i = 0; i < l.size(); i++)
				{
					for (int j = 0; j < r.size(); j++)
					{
						TreeNode* node = new TreeNode(k);
						node->left = l[i];
						node->right = r[j];
						res.push_back(node);
					}
				}
			}
		}
		return res;
	}
};