class Solution {
public:
vector<int> levelOrder(TreeNode* root) {
vector<int>res;
if(!root)return res;
queue<TreeNode*>q;
q.push(root);
while(q.size()){
auto t=q.front();
res.push_back(t->val);
q.pop();
if(t->left) q.push(t->left);
if(t->right)q.push(t->right);
}
return res;
}
};
二叉树的广度优先遍历(BFS)
最新推荐文章于 2023-12-15 22:54:31 发布