层序遍历相关题目:
LeetCode 102.二叉树的层序遍历
题目链接:
代码:
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> result;
queue<TreeNode*>que;
if(root!=nullptr) que.push(root);
while(!que.empty()){
vector<int>temp;
int size = que.size();
for(int i=0;i<size;i++){
TreeNode*Node = que.front();
que.pop();
temp.push_back(Node->val);
if(Node->left) que.push(Node->left);
if(Node->right) que.push(Node->right);
}
result.push_back(temp);
}
return result;
}
};
LeetCode 107.二叉树的层序遍历Ⅱ
题目链接:
代码:
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
queue<TreeNode*>que;
vector<vector<int>>result;
if(root!=nullptr) que.push(root);
while(!que.empty()){
int size = que.size();
vector<int>vec;
for(int i=0;i<size;i++){
TreeNode*Node=que.front();
que.pop();
vec.push_back(Node->val);
if(Node->left) que.push(Node->left);
if(Node->right) que.push(Node->right);
}
result.push_back(vec);
}
reverse(result.begin(),result.end());
return result;
}
};
LeetCode 199.二叉树的右视图
题目链接:
代码:
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
queue<TreeNode*>que;
vector<int>vec;
if(root!=nullptr) que.push(root);
while(!que.empty()){
int size = que.size();
for(int i=0;i<size;i++){
TreeNode*Node = que.front();
que.pop();
if(Node->left) que.push(Node->left);
if(Node->right) que.push(Node->right);
if(i==size-1) vec.push_back(Node->val);
}
}
return vec;
}
};
LeetCode 637.二叉树的层平均值
题目链接:
代码:
class Solution {
public:
vector<double> averageOfLevels(TreeNode* root) {
queue<TreeNode*>que;
vector<double>vec;
if(root!=nullptr) que.push(root);
while(!que.empty()){
int size = que.size();
double sum =0;
for(int i=0;i<size;i++){
TreeNode*Node = que.front();
que.pop();
sum+=Node->val;
if(Node->left) que.push(Node->left);
if(Node->right) que.push(Node->right);
}
vec.push_back(sum/size);
}
return vec;
}
};
LeetCode 429.N叉树的层序遍历
题目链接:
代码:
class Solution {
public:
vector<vector<int>> levelOrder(Node* root) {
queue<Node*>que;
vector<vector<int>>reselt;
if(root!=NULL){
que.push(root);
}
while(!que.empty()){
int size = que.size();
vector<int>vec;
for(int i=0;i<size;i++){
Node*temp = que.front();
que.pop();
vec.push_back(temp->val);
for(int j=0;j<temp->children.size();j++){
if(temp->children[j]){
que.push(temp->children[j]);
}
}
}
reselt.push_back(vec);
}
return reselt;
}
};
LeetCode 515.在每个树行中找最大值
题目链接:
代码:
class Solution {
public:
vector<int> largestValues(TreeNode* root) {
queue<TreeNode*>que;
vector<int>result;
if(root!=NULL) que.push(root);
while(!que.empty()){
int size = que.size();
int max_num = INT_MIN;
for(int i=0;i<size;i++){
TreeNode* Node = que.front();
que.pop();
max_num = max(max_num,Node->val);
if(Node->left) que.push(Node->left);
if(Node->right) que.push(Node->right);
}
result.push_back(max_num);
}
return result;
}
};
LeetCode 116.填充每个节点的下一个右侧节点指针
题目链接:
代码:
class Solution {
public:
Node* connect(Node* root) {
queue<Node*>que;
if(root!=NULL) que.push(root);
while(!que.empty()){
int size = que.size();
Node* pre;
Node* node;
for(int i=0;i<size;i++){
if(i==0){
pre = que.front();
que.pop();
node = pre;
}
else{
node = que.front();
que.pop();
pre->next = node;
pre = node;
}
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
pre->next = NULL;
}
return root;
}
};
LeetCode 226.翻转二叉树
题目链接:
代码:
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
queue<TreeNode*>que;
if(root!=NULL) que.push(root);
while(!que.empty()){
int size = que.size();
for(int i=0;i<size;i++){
TreeNode*temp = que.front();
que.pop();
if(temp->left) que.push(temp->left);
if(temp->right) que.push(temp->right);
TreeNode*temp_right = temp->right;
temp->right = temp->left;
temp->left = temp_right;
}
}
return root;
}
};
LeetCode 101.对称二叉树
题目链接:
LeetCode 101.对称二叉树
代码:
class Solution {
public:
bool Compare(TreeNode*left,TreeNode*right){
if(left==nullptr&&right==nullptr) return true;
else if(left!=nullptr&&right==nullptr) return false;
else if(left==nullptr&&right!=nullptr) return false;
else if(left->val!=right->val) return false;
else return Compare(left->left,right->right)&& Compare(left->right, right->left);
}
bool isSymmetric(TreeNode* root) {
if(root==nullptr) return true;
return Compare(root->left,root->right);
}
};