Unique Binary Search Trees 2

easy
Given an integer n, return all the structurally unique BST's (binary search trees), which has exactly n nodes of unique values from 1 to n. Return the answer in any order.

Input Format

Integer n

Output Format

List of TreeNode type

Constraints

1 <= n <= 8

Notice

NA

Example

Input

        
Output

        
Previous
Lowest Common Ancestor Of A Binary Tree
Next
All Possible Full Binary Trees

Related Questions