Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0001_0100.s0095_unique_binary_search_trees_ii.Solution

```
public class Solution
extends Object
```
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
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<TreeNode> generateTrees(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

generateTrees

public List<TreeNode> generateTrees(int n)