Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.

Example 1:

Example 2:

Constraints:

  • 1 <= n <= 19

Solution: Dynamic…