Class Solution
java.lang.Object
g0001_0100.s0095_unique_binary_search_trees_ii.Solution
95 - Unique Binary Search Trees II.
Medium
Given an integer n
, return all the structurally unique **BST’**s (binary search trees), which has exactly n
nodes of unique values from 1
to n
. Return the answer in any order.
Example 1:
Input: n = 3
Output: [[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
Example 2:
Input: n = 1
Output: 1
Constraints:
1 <= n <= 8
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
generateTrees
-