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 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>> levelEle;
void preOder(TreeNode* root ,int deep){
if(root==NULL)
return;
else
{
if(levelEle.size()<deep+1)
levelEle.resize(deep+1);
levelEle[deep].push_back(root->val);
preOder( root->left ,deep+1);
preOder( root->right ,deep+1);
}
}
vector<vector<int>> levelOrder(TreeNode* root) {
preOder(root,0);
return levelEle;
}
};