/**
* 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<int> levelOrder(TreeNode* root) {
vector<int> res;
if(!root)
return res;
queue<TreeNode*> q;
q.push(root);
while(q.size()){
TreeNode* node=q.front();//获取队列的头节点
q.pop();//弹出该节点
res.push_back(node->val);//将头节点压入队列中
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);//压入该节点的左右孩子
}
return res;
}
};