2014年11月17日
Reverse Linked List II
摘要： Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No... 阅读全文
posted @ 2014-11-17 23:11 Jessica程序猿 阅读(205) 评论(0) 推荐(0) 编辑
Unique Binary Search Trees
摘要： 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 @ 2014-11-17 13:26 Jessica程序猿 阅读(134) 评论(0) 推荐(0) 编辑
Symmetric Tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2014-11-17 10:10 Jessica程序猿 阅读(151) 评论(0) 推荐(0) 编辑
Validate Binary Search Tree
摘要： 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 @ 2014-11-17 08:51 Jessica程序猿 阅读(226) 评论(0) 推荐(0) 编辑