leetcode-95-不同的二叉搜索树 II

题目链接 https://leetcode-cn.com/problems/unique-binary-search-trees-ii/submissions/

思路：

将1-n中的任意一个数视为树的根节点，左边的视为左子树，右边视为右子树。然后递归的对左右子树进行这种操作。

public List<TreeNode> generateTrees(int n) {
         if(n < 1) {
             return  new ArrayList<>();
         }
         return generateTrees(1, n);
    }

    public List<TreeNode> generateTrees(int start, int end) {
         List<TreeNode> list = new ArrayList<>();

         if(start > end) {
             list.add(null);
             return  list;
         }
         for(int i = start; i <= end; i++) {
             List<TreeNode> left = generateTrees(start, i-1);
             List<TreeNode> right = generateTrees(i+1, end);

             for (TreeNode l : left) {
                 for (TreeNode r : right) {
                     TreeNode node = new TreeNode(i);
                     node.left = l;
                     node.right = r;
                     list.add(node);
                 }
             }
         }
         return list;
    }