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