2015年8月3日
First Missing Positive
摘要： Given an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Your algorithm should ru... 阅读全文
posted @ 2015-08-03 14:21 amazingzoe 阅读(181) 评论(0) 推荐(0)
Binary Search Tree Iterator ***
摘要： 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-08-03 12:09 amazingzoe 阅读(108) 评论(0) 推荐(0)
Count Complete Tree Nodes***
摘要： Given acompletebinary tree, count the number of nodes.Definition of a complete binary tree fromWikipedia:In a complete binary tree every level, except... 阅读全文
posted @ 2015-08-03 11:12 amazingzoe 阅读(146) 评论(0) 推荐(0)
Kth Smallest Element in a BST
摘要： Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota... 阅读全文
posted @ 2015-08-03 10:07 amazingzoe 阅读(167) 评论(0) 推荐(0)
Lowest Common Ancestor of a Binary Search Tree
摘要： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to thedefinition of LCA on Wikipedia: ... 阅读全文
posted @ 2015-08-03 09:52 amazingzoe 阅读(143) 评论(0) 推荐(0)
Lowest Common Ancestor****
摘要： Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest ... 阅读全文
posted @ 2015-08-03 00:05 amazingzoe 阅读(205) 评论(0) 推荐(0)