2015年10月27日
LeetCode OJ：Populating Next Right Pointers in Each Node II（指出每一个节点的下一个右侧节点II）
摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2015-10-27 22:14 eversliver 阅读(226) 评论(0) 推荐(0)
LeetCode OJ：Populating Next Right Pointers in Each Node（指出每一个节点的下一个右侧节点）
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2015-10-27 14:56 eversliver 阅读(219) 评论(0) 推荐(0)
LeetCode OJ：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 @ 2015-10-27 11:38 eversliver 阅读(243) 评论(0) 推荐(0)
LeetCode OJ：Serialize and Deserialize Binary Tree（对树序列化以及解序列化）
摘要： Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or ... 阅读全文
posted @ 2015-10-27 10:08 eversliver 阅读(277) 评论(0) 推荐(0)