Unique Binary Search Trees is an example of tree problems. In this post we will see how we can solve in Javascript.

Problem Description

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example,

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

Please check the main.js snippet for the solution.

If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!