2015年6月23日
leetCode(26):Unique Binary Search Trees 分类： leetCode 2015-06-23 14:09 155人阅读 评论(0) 收藏
摘要： 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. 1... 阅读全文
posted @ 2015-06-23 14:09 朱传林 阅读(108) 评论(0) 推荐(0)
leetCode(25):Validate Binary Search Tree 分类： leetCode 2015-06-23 13:00 154人阅读 评论(0) 收藏
摘要： Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n... 阅读全文
posted @ 2015-06-23 13:00 朱传林 阅读(163) 评论(0) 推荐(0)
leetCode(24):Binary Search Tree Iterator 分类： leetCode 2015-06-23 11:50 192人阅读 评论(0) 收藏
摘要： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next... 阅读全文
posted @ 2015-06-23 11:50 朱传林 阅读(116) 评论(0) 推荐(0)