Unique Binary Search Trees II

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
Example
Given n = 3, your program should return all 5 unique BST

Login to see Answer and Coaching Session More interview questions