【unique-binary-search-trees-ii】

最新推荐文章于 2020-08-09 19:09:04 发布

原创最新推荐文章于 2020-08-09 19:09:04 发布 · 638 阅读

0 ·

CC 4.0 BY-SA版权

leetcode记录专栏收录该内容

52 篇文章

订阅专栏

本文介绍了一种算法，用于生成从1到n的所有可能的不同结构的二叉搜索树。通过递归地选择根节点，并分别构建左子树和右子树，实现了这一过程。文章提供了一个C++实现示例。

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.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as"{1,2,3,#,#,4,#,#,5}".

题意：输出1到n组成的所有二叉搜索树的结构

思路：

选定1-n的一个数字i作为根节点、0到i-1是左子树， i+1-n是右子树，两层循环；

class Solution
{
public:
	vector<TreeNode*> generateTrees(int n)
	{
		return create(1, n);
	}

	vector<TreeNode*> create(int left, int right)
	{
		vector<TreeNode*> res;
		if (left>right)
		{
			res.push_back(NULL);
			return res;
		}

		for (int i=left; i<=right; i++)
		{
			vector<TreeNode*> leftTree = create(left, i-1);
			vector<TreeNode*> rightTree = create(i+1, right);

			for (int j = 0; j<leftTree.size(); j++)
			{
				for (int k = 0; k<rightTree.size(); k++)
				{
					TreeNode* root = new TreeNode(i);
					root->left = leftTree[j];
					root->right = rightTree[k];

					res.push_back(root);
				}
			}
		}

		return res;
	}
};