利用队列实现层序遍历
class Solution{
public:
vector<int>levelOrder(TreeNode* root){
vector<int>res;
if(root==NULL)return res;
queue<TreeNode*>q;
q.emplace(root);
while(!q.empty()){
TreeNode* node=q.front();
q.pop();
res.emplace_back(node->val);
if(node->left)q.emplace(node->left);
if(node->right)q.emplace(node->right);
}
return res;
}
};
/**
* 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> > ans;
if(root==NULL){
return ans;
}
q.push(root);
while(!q.empty()){
vector<int> temp;
for(int i=q.size();i>0;i--){ //这里的循环只会将队列q最初的长度值赋给i,所以后面入队的元素不影响
TreeNode* node = q.front();
q.pop();
temp.push_back(node->val);
if(node->left!=NULL) q.push(node->left);
if(node->right!=NULL) q.push(node->right);
}
ans.push_back(temp);//存下当前层的元素
}
return ans;
}
};
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*>q;
vector<vector<int>>res;
if(root==NULL)return res;
int r=0;
q.emplace(root);
while(!q.empty()){
++r;
vector<int>temp;
for(int i=q.size();i>0;i--){
TreeNode* node=q.front();
q.pop();
temp.emplace_back(node->val);
if(node->left)q.emplace(node->left);
if(node->right)q.emplace(node->right);
}
if(r%2==0)reverse(temp.begin(),temp.end());//偶数行倒序输出
res.emplace_back(temp);
}
return res;
}
};