不懂
文章平均质量分 72
lilibaobao89
这个作者很懒,什么都没留下…
展开
-
96. Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \原创 2017-01-16 12:49:57 · 226 阅读 · 0 评论 -
Unique Binary Search Trees II
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should return all 5 unique BST's shown below. 1原创 2017-01-17 07:46:03 · 206 阅读 · 0 评论 -
366. Find Leaves of Binary Tree
Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Given binary tree 1 / \原创 2017-01-24 14:15:59 · 291 阅读 · 0 评论