class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
queue<TreeNode*> q;
if(root!=NULL)
q.push(root);
while(!q.empty()){
vector<int> v;
int size = q.size();
while(size--){
TreeNode* root = q.front();
q.pop();
v.push_back(root->val);
if(root->left) q.push(root->left);
if(root->right) q.push(root->right);
}
res.push_back(v);
}
return res;
}
};
02-22
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交