给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
示例:
给定二叉树: [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其层次遍历结果:
[ [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>> levelOrder(TreeNode* root) {
queue<TreeNode*> Q;
vector<vector<int>> ret;
if(!root) return ret;
vector<int> tmp;
Q.push(root);
int numbers_current_level = 1;
int numbers_next_level = 0;
while(Q.empty()==false){
root = Q.front();
Q.pop();
tmp.push_back(root->val);
numbers_current_level--;
if(root->left){
Q.push(root->left);
numbers_next_level += 1;
}
if(root->right){
Q.push(root->right);
numbers_next_level += 1;
}
if(numbers_current_level==0){
numbers_current_level = numbers_next_level;
numbers_next_level = 0;
ret.push_back(tmp);
tmp.clear();
}
}
return ret;
}
};