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] ]
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
递归,使用l纪录当前遍历到哪一层
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void levelTravel (vector<vector<int>>& result, int l,TreeNode* p){
if(!p) return;
if(result.size()>l) result[l].push_back(p->val);
else{
vector<int> v;
v.push_back(p->val);
result.push_back(v);
}
levelTravel(result,l+1,p->left);
levelTravel(result,l+1,p->right);
}
vector<vector<int> > levelOrder(TreeNode *root) {
vector<vector<int>> result;
levelTravel(result,0, root);
return result;
}
};