95. Unique Binary Search Trees II
摘要:
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n. Example: Input: 3 Output: [ [1,null,3,2], 阅读全文
posted @ 2021-01-10 17:02 wsw_seu 阅读(87) 评论(0) 推荐(0) 编辑