题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
思路: 用队列实现,先将根结点入队,依次入队该结点的左右结点,再依次出队打印即可。
C++
/*
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 == NULL) return res;
TreeNode *p;
queue<TreeNode *>temp; //用队列实现
temp.push(root);
while (!temp.empty()) //依次将结点的左右结点入队
{
p = temp.front();
res.push_back(p -> val);
if (p -> left != NULL)
temp.push(p -> left);
if (p -> right != NULL)
temp.push(p -> right);
temp.pop();
}
return res;
}
};