给定一个整数 n,生成所有由 1 ... n 为节点所组成的二叉搜索树。
示例:
输入: 3 输出: [ [1,null,3,2], [3,2,null,1], [3,1,null,null,2], [2,1,3], [1,null,2,null,3] ] 解释: 以上的输出对应以下 5 种不同结构的二叉搜索树: 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
//计数的话可以利用前面的结果分割,未想出来怎么加上中间的序列 例:F(3) = F(2) + F(1) +F(2) F(4) = F(3) + F(2) + F(2) + F(3) //按照以某一个为根进行划分
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<TreeNode> generateTrees(int n) {
List<Integer> nums = new ArrayList<>();
if(n==0)
{
return new ArrayList<>();
}
for (int i = 0; i < n; i++)
{
nums.add(i + 1);
}
return generateTreeNode(nums);
}
private List<TreeNode> generateTreeNode(List<Integer> nums) {
if (nums.size() == 0)
{
return null;
}
List<TreeNode> resNodes = new ArrayList<>();
for (int i = 0; i < nums.size(); i++)
{
List<TreeNode> leftNodes = generateTreeNode(nums.subList(0, i));
List<TreeNode> rightNodes = generateTreeNode(nums.subList(i + 1, nums.size()));
if (leftNodes != null)
{
for (TreeNode leftNode : leftNodes)
{
if (rightNodes != null)
{
for (TreeNode rightNode : rightNodes)
{
TreeNode pNode = new TreeNode(nums.get(i));
pNode.left = leftNode;
pNode.right = rightNode;
resNodes.add(pNode);
}
}
else
{
TreeNode pNode = new TreeNode(nums.get(i));
pNode.left = leftNode;
pNode.right = null;
resNodes.add(pNode);
}
}
}
else
{
if (rightNodes != null)
{
for (TreeNode rightNode : rightNodes)
{
TreeNode pNode = new TreeNode(nums.get(i));
pNode.left = null;
pNode.right = rightNode;
resNodes.add(pNode);
}
}
else
{
TreeNode pNode = new TreeNode(nums.get(i));
pNode.left = null;
pNode.right = null;
resNodes.add(pNode);
}
}
}
return resNodes;
}
}