题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
思路:属于二叉树遍历的层序遍历,可以借助队列实现。
/*
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;
deque<TreeNode*> q;
q.push_back(root);
while(q.size()){
TreeNode* pNode = q.front();
q.pop_front();
res.push_back(pNode->val);
if(pNode->left)
q.push_back(pNode->left);
if(pNode->right)
q.push_back(pNode->right);
}
return res;
}
};