题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
解题思路:二叉树的层次遍历!
代码如下:
/*
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>pushV;
if(root==NULL)
return pushV;
queue<TreeNode*>Q;
Q.push(root);
while(!Q.empty())
{
TreeNode *p=Q.front();
Q.pop();
pushV.push_back(p->val);
if(p->left)
Q.push(p->left);
if(p->right)
Q.push(p->right);
}
return pushV;
}
};