< Previous 　　　　　　　　　　　　　　　　 Next >

96. Unique Binary Search Trees (Medium)

Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.

 

Example 1:

Input: n = 3
Output: 5

Example 2:

Input: n = 1
Output: 1

 

Constraints:

• 1 <= n <= 19

Related Topics

[Tree] [Binary Search Tree] [Math] [Dynamic Programming] [Binary Tree]

Similar Questions

1. Unique Binary Search Trees II (Medium)