bfs
文章平均质量分 72
蜜莉恩
这个作者很懒,什么都没留下…
展开
-
Binary Tree Zigzag Level Order Traversal (LeetCode)
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary原创 2014-01-27 13:10:35 · 437 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II (LeetCode)
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 still work? Note: You may only use constant原创 2014-01-27 11:16:34 · 417 阅读 · 0 评论