Structurally distinct BSTs
Given an integer n, return the number of structurally distinct binary search trees that store exactly the keys 1, 2, ..., n. Two trees are distinct if their shapes differ. For n = 0 there is exactly one tree (the empty tree). Assume 0 <= n <= 19 so the answer fits comfortably in a 64-bit integer.
Implement
num_unique_bst(n: int) → intExamples
in
[3]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[3]5not run yetsample