题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
/*
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> result;
if(root==NULL)
return result;
deque<TreeNode*> d;
d.push_back(root);
while(d.size()!=0)
{
TreeNode* temp=d.front();
if(temp->left)
d.push_back(temp->left);
if(temp->right)
d.push_back(temp->right);
result.push_back(temp->val);
d.pop_front();
}
return result;
}
};