/*
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) {
queue<TreeNode *>q;
vector<int>res;
q.push(root);
while(!q.empty())
{
TreeNode *r = q.front();
q.pop();
if(!r)
continue;
res.push_back(r->val);
q.push(r->left);
q.push(r->right);
}
return res;
}
};
从上往下打印二叉树
最新推荐文章于 2022-03-30 16:32:55 发布