- Binary Tree Level Order Traversal
Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).
Example 1:
Input: root = [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]
1.层序遍历
不使用hash。
每次保持queue中的元素都是在同一层,queue不为空时,计算queue的size,取出queue中的前size个元素,依次将这些元素的子节点放入queue,则queue中的元素仍然是同一层的
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
if(root==nullptr){
return res;
}
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
int cursize=q.size();
res.push_back(vector<int>(0));
for(int i=0;i<cursize;i++){
TreeNode* temp=q.front();
q.pop();
res.back().push_back(temp->val);
if(temp->left!=nullptr){
q.push(temp->left);
}
if(temp->right!=nullptr){
q.push(temp->right);
}
}
}
return res;
}
};
/*
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
if(root==nullptr){
return res;
}
queue<TreeNode*>q;
unordered_map<TreeNode*,int>m;
q.push(root);
m[root]=1;
while(!q.empty()){
TreeNode* temp=q.front();
q.pop();
if(m[temp]>res.size()){
res.push_back(vector<int>(0));
}
res[res.size()-1].push_back(temp->val);
if(temp->left!=nullptr){
q.push(temp->left);
m[temp->left]=m[temp]+1;
}
if(temp->right!=nullptr){
q.push(temp->right);
m[temp->right]=m[temp]+1;
}
}
return res;
}
*/