继续干,广度优先搜索。
/*
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;
queue<TreeNode *> q;
q.push(root);
TreeNode * temp;
while(!q.empty())
{
temp = q.front();
q.pop();
res.push_back(temp -> val);
if(temp -> left != NULL)
q.push(temp -> left);
if(temp -> right != NULL)
q.push(temp -> right);
}
return res;
}
};