102. 二叉树的层序遍历
难度中等
给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)。
思路1.0:
层次遍历,直接来!
代码1.0:
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
if (root == NULL) return vector<vector<int>>();
vector<vector<int>> ans;
queue<TreeNode*> que;
que.push(root);
while (!que.empty()) {
vector<int> thisLayer;
int len = que.size();
for (int i = 0; i < len; ++i) {
TreeNode* nowNode = que.front();
thisLayer.push_back(nowNode->val);
que.pop();
if (nowNode->left != NULL) que.push(nowNode->left);
if (nowNode->right != NULL) que.push(nowNode->right);
}
ans.push_back(thisLayer);
}
return ans;
}
};