Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 96. Unique Binary Search Trees
Reported Jun 3, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source