題目地址

https://leetcode-cn.com/problems/unique-binary-search-trees-ii/

題目描述

給定一個(gè)整數(shù) n，生成所有由 1 ... n 為節(jié)點(diǎn)所組成的二叉搜索樹。

示例:

輸入: 3
輸出:
[
  [1,null,3,2],
  [3,2,null,1],
  [3,1,null,null,2],
  [2,1,3],
  [1,null,2,null,3]
]
解釋:
以上的輸出對(duì)應(yīng)以下 5 種不同結(jié)構(gòu)的二叉搜索樹：

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

題解

遞歸解法

定義遞歸函數(shù) public List<TreeNode> build(int left, int right)，用來描述通過 [left, right] 構(gòu)建的所有二叉搜索樹。

class Solution {
    public List<TreeNode> generateTrees(int n) {
        return build(1, n);
    }

    public List<TreeNode> build(int left, int right) {
        if (left == right) {
            return Arrays.asList(new TreeNode(left));
        }
        if (left > right) {
            List<TreeNode> roots = new ArrayList<>();
            roots.add(null);
            return roots;
        }

        List<TreeNode> roots = new ArrayList<>();

        for (int i = left; i <= right; ++ i) {
            // [left, i - 1] 作為 left 子樹
            List<TreeNode> leftTree = build(left, i - 1);

            // [i+1, right] 作為 right 子樹
            List<TreeNode> rightTree = build(i+1, right);

            for (int leftIndex = 0; leftIndex < leftTree.size(); ++ leftIndex) {
                for (int rightIndex = 0; rightIndex < rightTree.size(); ++ rightIndex) {
                    // i 作為 root 節(jié)點(diǎn)
                    TreeNode root = new TreeNode(i);

                    root.left = leftTree.get(leftIndex);
                    root.right = rightTree.get(rightIndex);

                    roots.add(root);
                }
            }
        }
        
        return roots;
    }
}