Leetcode 95. Unique Binary Search Trees II

Posted 2022-11-27 zhangwj0101

Question

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

Code

public List<TreeNode> get(int left, int right) 
        List<TreeNode> res = new ArrayList<>();
        if (left <= right) 
            for (int i = left; i <= right; i++) 
                List<TreeNode> l = get(left, i - 1);
                List<TreeNode> r = get(i + 1, right);
                for (TreeNode ll : l) 
                    for (TreeNode lr : r) 
                        TreeNode s = new TreeNode(i);
                        s.left = ll;
                        s.right = lr;
                        res.add(s);
                    
                
            

         else 
            res.add(null);
        
        return res;
    

    public List<TreeNode> generateTrees(int n) 
        if (n == 0) 
            return new ArrayList<>();
        
        return get(1, n);