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

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Unique Binary Search Trees on Interview Code Editor
2784 successful submissions.
Asked In:
  • Amazon
  • Twitter
Click here to start solving coding interview questions