2015年3月13日
leetcode------Populating Next Right Pointers in Each Node II
摘要： 标题：Populating Next Right Pointers in Each Node II通过率：31.7%难度：难Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tr... 阅读全文
posted @ 2015-03-13 12:20 pku_smile 阅读(160) 评论(0) 推荐(0) 编辑
leetcode------Populating Next Right Pointers in Each Node
摘要： 标题：Populating Next Right Pointers in Each Node通过率:36.1%难度：中等Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *r... 阅读全文
posted @ 2015-03-13 12:18 pku_smile 阅读(149) 评论(0) 推荐(0) 编辑