Merge pull request neetcode-gh#3261 from a1exanddrovich/0095-dev

MHamiid · web-flow · commit 8914d5c894fb · 2024-01-30T12:27:08.000+02:00
Create: 0095-unique-binary-search-trees-ii.java
diff --git a/java/0095-unique-binary-search-trees-ii.java b/java/0095-unique-binary-search-trees-ii.java
@@ -0,0 +1,27 @@
+class Solution {
+    public List<TreeNode> generateTrees(int n) {
+        return generate(1, n);
+    }
+
+    private List<TreeNode> generate(int left, int right) {
+        if (left > right) {
+            List<TreeNode> r = new ArrayList<>();
+            r.add(null);
+            return r;
+        }
+
+        List<TreeNode> res = new ArrayList<>();
+        for (int val = left; val <= right; val++) {
+            for (TreeNode leftSubtree : generate(left, val - 1)) {
+                for (TreeNode rightSubtree: generate(val + 1, right)) {
+                    TreeNode root = new TreeNode(val);
+                    root.left = leftSubtree;
+                    root.right = rightSubtree;
+                    res.add(root);
+                }
+            }
+        }
+
+        return res;
+    }
+}
