Open Sonia312 opened 9 months ago
@Sonia312 I would like to work on this issue. Please assign it to me.
hello ! I am interested in working on this issue. Please assign it to me .Thanks!
Please mention your complete name, year, roll number and email
@Sonia312 Could you please assign me this issue. UEC2023260 FY Sharwari Tijare email: sharwari.tijare@gmail.com
Please mention your complete name, year, roll number and email
I am Saniya Karambelkar , Sy Comp , Cummins college of Engineering
Write code in the preferred language and attach output with it.
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.
Example 1:
Input: n = 3 Output: [[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
Example 2:
Input: n = 1 Output: [[1]]