LeetCode 102: Binary Tree Level Order Traversal
2015-10-27 22:49
323 查看
Binary Tree Level Order Traversal
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}
return its level order traversal as:
解题思路
考察二叉树的层次遍历,利用队列(queue)很容易就可以实现该功能。代码如下:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<vector<int>> levelOrder(TreeNode* root) { vector<vector<int>> result; if (root == NULL) return result; queue<TreeNode *> nodeQueue; nodeQueue.push(root); while (!nodeQueue.empty()) { vector<int> level_values; int level_size = nodeQueue.size(); // Note: 判断每层的元素个数 for (int i = 0; i < level_size; ++i) { TreeNode *front = nodeQueue.front(); nodeQueue.pop(); level_values.push_back(front->val); if (front->left != NULL) nodeQueue.push(front->left); if (front->right != NULL) nodeQueue.push(front->right); } result.push_back(level_values); } return result; } };
相关文章推荐
- Mysql Error Code : 1436 Thread stack overrun
- 基于java中stack与heap的区别,java中的垃圾回收机制的相关介绍
- Python算法之栈(stack)的实现
- Stack数据结构的特点后进先出的应用:大数据运算
- C 堆栈,运行时类型挷定
- jstack和线程dump分析
- c语言stack实现--数据域与指针域分开
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- 深入Java虚拟机
- 搭建CloudStack
- 新手,正在学Java Collection,瞎写点东西-一个基于链表的stack及其遍历
- 转贴一份挺好的堆和栈区别的资料
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum