mariano/100-days-of-rust
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
836fef728d
100-days-of-rust/Week-02/Day-10_Unique-Binary-Search-Trees
History
Mariano b3f9c09f44 Wrote program for Day 10 
https://en.wikipedia.org/wiki/Catalan_number
2024-08-04 16:37:26 +02:00
..
day10 Wrote program for Day 10 2024-08-04 16:37:26 +02:00
README.md Add files via upload 2023-03-23 20:52:21 -04:00

README.md

Unique Binary Search Trees

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

Examples

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

Constraints

  • 1 <= n <= 19

Notes

  • N/A