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