leetcode-unique binary search tree II

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.

public class Solution {
    
    
    public List<TreeNode> generateTrees(int n) {
         return myGenerate(1,n);
        }
    
    public LinkedList<TreeNode> myGenerate(int start,int end){
        
        LinkedList<TreeNode> result=new LinkedList<TreeNode>();
        if(start>end)result.add(null);
        if(start==end)result.add(new TreeNode(start));
        else if(start<end){
            for(int i=start;i<=end;i++){
                LinkedList<TreeNode> left=myGenerate(start,i-1);
                LinkedList<TreeNode> right=myGenerate(i+1,end);
                for(TreeNode a:left){
                    for(TreeNode b:right){
                        TreeNode root=new TreeNode(i);
                        root.left=a;
                        root.right=b;
                        result.add(root);
                    }
                }
            }
        }
        return result;
    }
}

The thought is that we choose the element from 1 to n in each recursive call. and the use the same method for the left and right subtree of this node.

1. Because we don't know how many subtrees in the left and right, so we need the structure of List to store them. 

2. We cannot let the recursive call change the result. So the simplest method is that in each recursive call, we create a new result to store the combination in each level.

3 don't forget the edge case. All the other stuff is the logic.