[LeetCode] 95. Unique Binary Search Trees II(Java)
Given an integern, generate all structurally uniqueBST's(binary search trees) that store values 1 ...n.
Example:
Input: 3
Output:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3...
原创
2020-01-01 22:47:12 ·
134 阅读 ·
0 评论