Leetcode 96. Unique Binary Search Trees
Count the number of structurally unique binary search trees that can be formed using values 1..n. This is equivalent to computing the nth Catalan number (can be solved via dynamic programming or a combinatorial formula), with n ≤ 19.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.