剑指offer系列(22)从上到下打印二叉树
解题思路:依次将每一层节点存放至队列中,队列中的节点个数为该层节点数,依次弹出。在弹出时将其孩子节点依次放至队列,逐层遍历。
class Solution {
public:
vector<int> PrintFromTopToBottom(TreeNode* root) {
vector<int> res;
queue<TreeNode*> que;
if (root == nullptr) return res;
que.push(root);
while (!que.empty()){
int size = que.size();
for (int i = 0; i < size; i++){
TreeNode* node = que.front();
res.push_back(node->val);
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return res;
}
}