# Unique Binary Search Trees

Given*n*, how many structurally unique **BST's** (binary search trees) that store values 1 ... *n*?

## **Example**

```
Input: 3

Output: 5

Explanation:

Given 
n = 3, there are a total of 5 unique BST's:

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3
```

## Note

The problem is to calculate the number of unique BST. To do so, we can define two functions:

1. G(n): the number of unique BST for a sequence of length`n`.
2. F(i, n): the number of unique BST, where the number`i`is served as the root of BST (1≤i≤n).

As we can see,

> G(n) is actually the desired function we need in order to solve the problem.

*Later we would see that G(n) can be deducted from F(i, n), which at the end, would recursively refers to G(n).*![](/files/-LUgq3A19nAfcwC-iogv)\
For example, F(3, 7) the number of unique BST tree with the number `3` as its root.

* F(3,7) = G(2)\*G(4), where \[1,2] for G(2) and \[4, 5, 6, 7] for G(4)
* F(i, n) = G(i - 1) \* G(n - i)
* Summing F(i, n) ==> G(n) = ∑(G(i - 1)\*G(n - i)) for 1 <= i <= n, and G(0) = G(1) = 1

[**Catalan number**](https://en.wikipedia.org/wiki/Catalan_number) **for best**

C\_n+1/C\_n = 2(2n+1)/(n+2)

## Code

```java
class Solution {
    public int numTrees(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        for (int i = 1; i <= n; i++)
            for (int j = 0; j < i; j++)
                dp[i] += dp[j] * dp[i - j - 1];
        return dp[n];
    }
}
```

```java
class Solution {
  public int numTrees(int n) {
    // Note: we should use long here instead of int, otherwise overflow
    long C = 1;
    for (int i = 0; i < n; ++i) {
      C = C * 2 * (2 * i + 1) / (i + 2);
    }
    return (int) C;
  }
}
```

Print them all - O(4^n/n^0.5)

```java
class Solution {
    public List<TreeNode> generateTrees(int n) {
        List<TreeNode> res = new ArrayList<>();
        if (n == 0) return res;
        return helper(1, n);
    }

    public List<TreeNode> helper(int start, int end) {
        List<TreeNode> list = new ArrayList<>();
        if (start > end) list.add(null);
        for (int index = start; index <= end; index++) {
            List<TreeNode> leftlist  = helper(start, index - 1);
            List<TreeNode> rightlist = helper(index + 1, end);
            for (TreeNode left : leftlist) {
                for (TreeNode right : rightlist) {
                    TreeNode root = new TreeNode(index);
                    root.left  = left;
                    root.right = right;
                    list.add(root);
                }
            }
        }
        return list;
    }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://luj.gitbook.io/code/tree/bst/unique-binary-search-trees.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.