题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
思路:层次遍历二叉树,用队列即可
C++
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
vector<int> PrintFromTopToBottom(TreeNode* root) {
vector<int> res;
if(!root) return res; //如果二叉树为空,这直接返回空数组
queue<TreeNode*> nodes;
TreeNode *mid = NULL;
nodes.push(root);
while(!nodes.empty()) // 队列非空
{
mid = nodes.front();
res.push_back(mid->val);
if(mid->left) nodes.push(mid->left);
if(mid->right) nodes.push(mid->right);
nodes.pop();
}
return res;
}
};