Solving Unique Binary Search Trees in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example:

Input: 3
Output: 5
Explanation:
Given n = 3, there are a total of 5 unique BST's:

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

See the full details of the problem Unique Binary Search Trees at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go