思路1:使用BFS即可
/*
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> myvector;
if(root)
{
queue<TreeNode*> myqueue;
myqueue.push(root);
while(!myqueue.empty())
{
TreeNode*node=myqueue.front();
myvector.push_back(node->val);
myqueue.pop();
if(node->left)
myqueue.push(node->left);
if(node->right)
myqueue.push(node->right);
}
return myvector;
}
else
return myvector;
}
};