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] ]
/**
* 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) {
vector<vector<int> > vecArray;
if (root == NULL)
return vecArray;
queue<TreeNode *> queueTree;
queueTree.push(root);
while (!queueTree.empty()) {
int n = queueTree.size();
TreeNode *pTree;
vector<int> ivec;
for (int i = 0; i < n; i++) {
pTree = queueTree.front();
queueTree.pop();
if (pTree->left)
queueTree.push(pTree->left);
if (pTree->right)
queueTree.push(pTree->right);
ivec.push_back(pTree->val);
}
vecArray.push_back(ivec);
}
return vecArray;
}
};