leetcode 95. Unique Binary Search Trees II 唯一二叉搜索树

最新推荐文章于 2024-10-01 18:51:18 发布

he25819

最新推荐文章于 2024-10-01 18:51:18 发布

阅读量89

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/he25819/article/details/109218319

版权

二叉搜索树深度优先搜索 DFS 树结构算法

关键词由CSDN通过智能技术生成

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

题意

Input: 3
Output:
[
  [1,null,3,2],
  [3,2,null,1],
  [3,1,null,null,2],
  [2,1,3],
  [1,null,2,null,3]
]

解

上一题 96. Unique Binary Search Trees
dfs即可，直接看代码

    // Runtime: 1 ms, faster than 96.03% of Java online submissions for Unique Binary Search Trees II.
    //Memory Usage: 39.7 MB, less than 13.06% of Java online submissions for Unique Binary Search Trees II.
    public List<TreeNode> generateTrees(int n) {
        if (n == 0)
            return new ArrayList<>();
        return generateTrees(1, n);
    }

    private List<TreeNode> generateTrees(int m, int n) {
        if (m > n)
            return null;
        List<TreeNode> list = new ArrayList<>();

        List<TreeNode> tmp = new ArrayList<>();
        tmp.add(null);
        for (int i = m; i <= n; i++) {
            List<TreeNode> leftNodes = generateTrees(m, i - 1);
            List<TreeNode> rightNodes = generateTrees(i + 1, n);
            for (TreeNode leftNode : leftNodes == null ? tmp : leftNodes) {
                for (TreeNode rightNode : rightNodes == null ? tmp : rightNodes) {
                    list.add(new TreeNode(i, leftNode, rightNode));
                }
            }
        }
        return list;
    }