题目描述:
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
分析:
完整代码:
/*
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> array;
//检查输入输入的合法性
if(root == nullptr)
return array;
//声明一个队列
deque<TreeNode*> dequeTreeNode;
//将树的根节点从队列尾端入队
dequeTreeNode.push_back(root);
//如果队列为空,则一直循环
while(dequeTreeNode.size())
{
//声明一个节点指针指向队列的队首
TreeNode* pNode = dequeTreeNode.front();
//删除队首元素
dequeTreeNode.pop_front();
//将pNode所指的节点压入容器
array.push_back(pNode->val);
//非空左节点入栈
if(pNode->left)
dequeTreeNode.push_back(pNode->left);
//非空右节点入栈
if(pNode->right)
dequeTreeNode.push_back(pNode->right);
}
//返回容器array
return array;
}
};