Binary Tree Level Order Traversal
2015-06-19 23:29
295 查看
Description:
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree
return its level order traversal as:
Code:
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree
{3,9,20,#,#,15,7},
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
Code:
vector<vector<int>> levelOrder(TreeNode* root) { deque<TreeNode*>a; deque<TreeNode*>b; if (root) a.push_back(root); TreeNode*p = NULL; vector<vector<int>> result; while (!a.empty()) { vector<int>temp; if (!a.empty() ) { while (!a.empty() ) { p = a.front(); a.pop_front(); temp.push_back(p->val); if (p->left) b.push_back(p->left); if (p->right) b.push_back(p->right); } result.push_back(temp); } while (!b.empty()) { a.push_back(b.front()); b.pop_front(); } } return result; }
相关文章推荐
- java单例模式的讨论
- 补第一阶段冲刺站立会议3(应发表日期5月15日)
- 关于数列1,1,2,3,5,8,13,21,34..用C#语言编程求第n项为?
- POJ 1155 树形DP
- 使用ScrollView实现下拉刷新(一)
- linux权限
- Uniform Generator
- CODE[VS] 1214 线段覆盖
- AES Test vectors
- CODE[VS] 1214 线段覆盖
- Uniform Generator 分类: HDU 2015-06-19 23:26 11人阅读 评论(0) 收藏
- 软件工程读后感
- mysql 运维角度浅谈:MySQL数据库优化
- Missing Ranges
- George and Job
- SqlDataAdapter.Update()方法与SqlCommandBuilder(转)
- sgu271:Book Pile(reverse大法好)
- HDU 1247 Hat's Words (字典树)
- 15ch
- POJ 1947树形DP