/**
* 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>> ans;
queue<TreeNode*> q;
if (!root) {
return ans;
}
q.push(root);
while (!q.empty()) {
int size = q.size();
vector<int> tmp(size, 0);
for (int i = 0; i < size; i++) {
TreeNode* curNode = q.front();
q.pop();
tmp[i] = curNode->val;
if (curNode->left) {
q.push(curNode->left);
}
if (curNode->right) {
q.push(curNode->right);
}
}
ans.push_back(tmp);
}
return ans;
}
};
二叉树层次遍历
最新推荐文章于 2022-05-01 13:29:30 发布