queue<TreeNode*> find_level(queue<TreeNode*>q){
queue<TreeNode*>res;
while(!q.empty()) {
TreeNode* top = q.front();
q.pop();
if(top==NULL) continue;
res.push(top->left);
res.push(top->right);
}
return res;
}
这是将NULL结点也放进去的版本(上面)