Structurally distinct BSTs
Your task
Given an integer n, return the number of structurally distinct binary search trees that store the values 1..n exactly once. n is between 0 and 19. (For n=0 there is one tree: the empty tree.)
Examples
num_trees(n: int) -> intExample 1
Input
num_trees(3)Output
5