c++为啥这道题这样不对呢
一道常见的二叉树层序遍历
class Solution {
public:
vector<vector<int>> res;
void ftraversal(vector<TreeNode*> temp)
{
vector<int> floor;
vector<TreeNode*> buf;
for(auto ch:temp)
{
if(!ch)
{
floor.push_back(ch->val);
buf.push_back(ch->left);
buf.push_back(ch->right);
}
}
res.push_back(floor);
ftraversal(buf);
return ;
}
vector<vector<int>> levelOrder(TreeNode* root) {
if(!root)
return res;
vector<TreeNode*> a;
a.push_back(root);
ftraversal(a);
return res;
}
};
有没有大佬可以帮我看一下
#C/C++#
