AcWing 43. 不分行从上往下打印二叉树
原题链接
简单
作者:
George
,
2020-11-19 00:23:52
,
所有人可见
,
阅读 389
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> res;
vector<int> printFromTopToBottom(TreeNode* root) {
if(root == NULL) return res;
queue<TreeNode*> q;
q.push(root);
while(q.size()){
auto p = q.front();
q.pop();
res.push_back(p->val);
if(p->left) q.push(p->left);
if(p->right) q.push(p->right);
}
return res;
}
};