LEETCODE
UNLOCKED
Problems
Donate
Premium
Unique Binary Search Trees II
Solution Code
Time Complexity
O(
G_n
)
where G_n is the n-th Catalan number.
Space Complexity
O(
G_n
)
