/**
* 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<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
if(!root) return res;
queue<TreeNode*> q;
TreeNode* cur = root;
q.push(cur);
while(!q.empty()){
vector<int> row;
int size = q.size();
for(int i=0;i<size;++i){
cur = q.front();
q.pop();
row.push_back(cur->val);
if(cur->left) q.push(cur->left);
if(cur->right) q.push(cur->right);
}
res.push_back(row);
}
return res;
}
};
102. 二叉树的层次遍历/C++
最新推荐文章于 2024-01-11 17:27:46 发布