class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>>vv;
if(root==nullptr)
return vv;
queue<TreeNode*>q;
q.push(root);
while(!q.empty())
{
vector<int>v;
int sz=q.size();
for(int i=0;i<sz;++i)
{
root=q.front();
v.push_back(root->val);
q.pop();
if(root->left)
q.push(root->left);
if(root->right)
q.push(root->right);
}
vv.push_back(v);
}
return vv;
}
};
二叉树的层序遍历(逐层打印)非递归
最新推荐文章于 2023-10-06 09:34:51 发布