2014年4月14日

Populating Next Right Pointers in Each Node - LeetCode

摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文

posted @ 2014-04-14 10:02 iisahu 阅读(116) 评论(0) 推荐(0)

Binary Tree Inorder Traversal - LeetCode

摘要： 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-04-14 09:55 iisahu 阅读(129) 评论(0) 推荐(0)

导航