思路:二叉树的层序遍历,用到队列结构
代码如下:
/*
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)
{
deque<TreeNode*> q;//层序遍历用队列先进先出
vector<int> r;
if(root==NULL)
return r;
q.push_back(root);
while(!q.empty())
{
TreeNode *pNode=q.front();
q.pop_front();
r.push_back(pNode->val);
if(pNode->left)
q.push_back(pNode->left);
if(pNode->right)
q.push_back(pNode->right);
}
return r;
}
};