unique_binary_search_trees

README

< Previous 　　　　　　　　　　　　　　　　 Next >

96. Unique Binary Search Trees (Medium)

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

Related Topics

[Tree] [Dynamic Programming]

Similar Questions

1. Unique Binary Search Trees II (Medium)