随笔分类 - BFS

Leetcode 103 Binary Tree Zigzag Level Order Traversal

摘要：和之前的层次遍历是一样的，只不过要在最后处理数组的时候，下一个层次利用reverse反转就好 1 class Solution { 2 public: 3 vector > zigzagLevelOrder(TreeNode* root) { 4 vector > v; 5 ... 阅读全文

posted @ 2015-07-03 09:27 又岸阅读(201) 评论(0) 推荐(0)

Leetcode 102/107 Binary Tree Level Order Traversal

摘要：Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文

posted @ 2015-07-03 06:21 又岸阅读(167) 评论(0) 推荐(0)