Unique Binary Search Trees


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

Input Format:

The first and the only argument of input contains the integer, A.

Output Format:

Return a list of tree nodes representing the generated BST's.

Constraints:

1 <= A <= 15

Example:

Input 1:
    A = 3

Output 1:

   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
Hints
  • No Hints for Checkpoint Problems
Asked In:

Discussion


Loading...
Click here to start solving coding interview questions