LeetCode 0096 - Unique Binary Search Trees
Unique Binary Search Trees
Desicription
Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?
For example,
Given n = 3, there are a total of 5 unique BST’s.
1 | 1 3 3 2 1 |
Solution
1 | class Solution { |