Unique Binary Search Trees

Given A, generate all structurally unique BST’s (binary search trees) that store values 1...A.

Example :
Given A = 3, your program should return all 5 unique BST’s shown below.


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

Interview Code Editor
2171 successful submissions.
Asked In:
  • Amazon
  • Twitter
Click here to jump start your coding interview preparation