摘要: 题目:Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. ... 阅读全文
posted @ 2014-12-14 17:29 Jarvis_Wu 阅读(269) 评论(0) 推荐(0) 编辑