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}
,
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
Solution:
/**
* Definition for binary tree
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > result;
vector<TreeNode*> level;
if(root)
level.push_back(root);
while(!level.empty()){
vector<int> r;
vector<TreeNode*> next;
for(int i=0;i<level.size();++i){
r.push_back(level[i]->val);
if(level[i]->left)
next.push_back(level[i]->left);
if(level[i]->right)
next.push_back(level[i]->right);
}
level=next;
result.push_back(r);
}
return result;
}
};