Leetcode Problem 95. Unique Binary Search Trees II

95. Unique Binary Search Trees II

Leetcode Solutions

Define a recursive function generateTreesFromRange(start, end) that returns a list of all possible BSTs that can be formed using values from start to end.
If start > end, return a list containing null (base case).
Initialize an empty list allTrees to store the BSTs.
Iterate from i = start to end, treating i as the root value.
Recursively call generateTreesFromRange(start, i - 1) to generate all left subtrees.
Recursively call generateTreesFromRange(i + 1, end) to generate all right subtrees.
For each combination of left and right subtree, create a new tree with i as the root and add it to allTrees.
Return allTrees.
Call generateTreesFromRange(1, n) to generate all BSTs for the given n.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen