2014年9月20日
LeetCode Populating Next Right Pointers in Each Node
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2014-09-20 18:17 birdhack 阅读(137) 评论(0) 推荐(0)
LeetCode Binary Tree Inorder Traversal
摘要： Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2014-09-20 12:26 birdhack 阅读(89) 评论(0) 推荐(0)