题目如下
思路与代码
老生常谈啊,offer面试少不了树的编程,要一层层的访问这个和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> ret;
queue<TreeNode*> q;
if(root)
q.push(root);
while(!q.empty()){
TreeNode *node=q.front();
q.pop();
ret.push_back(node->val);
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
return ret;
}
};