我的解题:
层次遍历
class Solution {
public:
vector<int> levelOrder(TreeNode* root) {
vector<int> res;
if(root==NULL) return res;
queue<TreeNode*> q;
q.push(root);
TreeNode* tmp;
while(!q.empty()){
tmp=q.front();
q.pop();
res.push_back(tmp->val);
if(tmp->left) q.push(tmp->left);
if(tmp->right) q.push(tmp->right);
}
return res;
}
};