level遍历102. Binary Tree Level Order Traversal
来源:互联网 发布:不配说爱我网络 编辑:程序博客网 时间:2024/06/18 10:37
/*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNode *left;* TreeNode *right;* TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };* 奇数的时候a出对,b入队*/class Solution {public: vector<vector<int>> levelOrder(TreeNode* root) { vector<vector<int>> ans; if (root == NULL) return ans; int cnt = 1; queue<TreeNode*> a[2]; a[1].push(root); while (a[0].size() || a[1].size()) { vector<int> tmp; while (a[cnt].size()) { root = a[cnt].front(); a[cnt].pop(); if (root->left) a[(cnt + 1) % 2].push(root->left); if (root->right) a[(cnt + 1) % 2].push(root->right); tmp.push_back(root->val); } cnt = (cnt + 1) % 2; ans.push_back(tmp); } return ans; }};
0 0
- level遍历102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal(层次遍历)
- level 遍历107. Binary Tree Level Order Traversal II
- LeetCode 102. Binary Tree Level Order Traversal
- [LeetCode]102.Binary Tree Level Order Traversal
- [Leetcode] 102. Binary Tree Level Order Traversal
- LeetCode --- 102. Binary Tree Level Order Traversal
- [leetcode] 102.Binary Tree Level Order Traversal
- 102.Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 【leetcode】102. Binary Tree Level Order Traversal
- 102.Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- Leetcode 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal LeetCode
- 102. Binary Tree Level Order Traversal
- 总结最近一周遇到的开发问题.
- 【矩阵快速幂】 斐波那契数列求解。
- 学 Java 有必要看数据结构的书吗?如果是,那么哪本书比较好?
- 鼠标滚轮事件
- spring学习总结(五):IOC & DI 配置 Bean 之自动装配及bean之间的关系
- level遍历102. Binary Tree Level Order Traversal
- 如果有人让你推荐编程技术书,请叫他看这个列表
- 【bzoj 1179】[Apio2009]Atm(Tarjan+spfa)
- leetcode(E)two sum
- [hdu 5973 Game of Taking Stones] Wythoff Game+大数运算
- Linux UDP网络编程
- 数据结构中的树
- 总结37
- HDU 5978 icpc 大连 To begin or not to begin