2015年4月13日
Path Sum II——LeetCode
摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2015-04-13 21:11 丶Blank 阅读(138) 评论(0) 推荐(0)
Flatten Binary Tree to Linked List ——LeetCode
摘要： Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2015-04-13 20:36 丶Blank 阅读(120) 评论(0) 推荐(0)
Generate Parentheses——LeetCode
摘要： Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
posted @ 2015-04-13 20:13 丶Blank 阅读(164) 评论(0) 推荐(0)
Binary Search Tree Iterator——LeetCode
摘要： 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-04-13 19:53 丶Blank 阅读(145) 评论(0) 推荐(0)