代码随想录刷题第12天 | 二叉树 层序遍历
102.二叉树的层序遍历
当模版记住都行
/**
* 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) {
queue<TreeNode*>que;
if(root!=nullptr) que.push(root);
vector<vector<int>>result;
while(!que.empty()){
vector<int>vec;
int size = que.size();
for(int i = 0; i < size;i++){
TreeNode *cur = que.front();
que.pop();
vec.push_back(cur->val);
if(cur->left!=nullptr) que.push(cur->left);
if(cur->right!=nullptr) que.push(cur->right);
}
result.push_back(vec);
}
return result;
}
};
107. 二叉树的层序遍历 II
一直以为reverse只能反转一维的,原来二维也行,反转外层
/**
* 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>> levelOrderBottom(TreeNode* root) {
queue<TreeNode *>que;
if(root!=nullptr) que.push(root);
vector<vector<int>>result;
while(!que.empty()){
vector<int>vec;
int size = que.size();
for(int i = 0;i < size;i++){
TreeNode *cur = que.front();
que.pop();
vec.push_back(cur->val);
if(cur->left!=nullptr) que.push(cur->left);
if(cur->right!=nullptr) que.push(cur->right);
}
result.push_back(vec);
}
reverse(result.begin(),result.end());
return result;
}
};
199.二叉树的右视图
层次遍历,然后每层都保留最后一个值就行
/**
* 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<int> rightSideView(TreeNode* root) {
queue<TreeNode *>que;
if(root!=nullptr) que.push(root);
vector<int>result;
while(!que.empty()){
int size = que.size();
for(int i = 0;i < size;i++){
TreeNode *cur = que.front();
que.pop();
if (i==(size-1))
result.push_back(cur->val);
if(cur->left!=nullptr)
que.push(cur->left);
if(cur->right!=nullptr)
que.push(cur->right);
}
}
return result;
}
};
637.二叉树的层平均值
/**
* 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<double> averageOfLevels(TreeNode* root) {
queue<TreeNode *>que;
if(root!=nullptr) que.push(root);
vector<double>result;
while(!que.empty()){
int size = que.size();
double sum = 0;
for(int i = 0;i < size;i++){
TreeNode *cur = que.front();
que.pop();
sum+=cur->val;
if(cur->left!=nullptr)
que.push(cur->left);
if(cur->right!=nullptr)
que.push(cur->right);
}
result.push_back(sum/size);
}
return result;
}
};
429.N叉树的层序遍历
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<vector<int>> levelOrder(Node* root) {
queue<Node *>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++){
Node *cur = que.front();
que.pop();
vec.push_back(cur->val);
for(int j=0;j<cur->children.size();j++){
if(cur->children[j]!=nullptr) que.push(cur->children[j]);
}
}
result.push_back(vec);
}
return result;
}
};
515.在每个树行中找最大值
居然有INT_MIN这种东西,之前都不知道,去查了下,基本上都有,LONG_MING LONG_MIN啥的,挺好
/**
* 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<int> largestValues(TreeNode* root) {
queue<TreeNode *>que;
vector<int>result;
if(root!=nullptr) que.push(root);
while(!que.empty()){
int size = que.size();
int max_val = INT_MIN;
for(int i = 0;i < size;i++){
TreeNode *cur = que.front();
que.pop();
if(cur->val > max_val) max_val = cur->val;
if(cur->left!=nullptr) que.push(cur->left);
if(cur->right!=nullptr) que.push(cur->right);
}
result.push_back(max_val);
}
return result;
}
};
116. 填充每个节点的下一个右侧节点指针
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() : val(0), left(NULL), right(NULL), next(NULL) {}
Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
Node(int _val, Node* _left, Node* _right, Node* _next)
: val(_val), left(_left), right(_right), next(_next) {}
};
*/
class Solution {
public:
Node* connect(Node* root) {
queue<Node *>que;
if(root!=nullptr) que.push(root);
while(!que.empty()){
int size = que.size();
Node *pre_node;
Node *cur_node;
for(int i = 0;i<size;i++){
if(i==0){
pre_node = que.front();
que.pop();
cur_node = pre_node;
}
else{
cur_node = que.front();
que.pop();
pre_node->next = cur_node;
pre_node = pre_node->next;
}
if(cur_node->left!=nullptr) que.push(cur_node->left);
if(cur_node->right!=nullptr) que.push(cur_node->right);
}
}
return root;
}
};
117.填充每个节点的下一个右侧节点指针II
这个代码我用上面那个一模一样的代码还是一样的过。。。。两个题思路一样
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() : val(0), left(NULL), right(NULL), next(NULL) {}
Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
Node(int _val, Node* _left, Node* _right, Node* _next)
: val(_val), left(_left), right(_right), next(_next) {}
};
*/
class Solution {
public:
Node* connect(Node* root) {
queue<Node *>que;
if(root!=nullptr) que.push(root);
while(!que.empty()){
int size = que.size();
Node *pre_node;
Node *cur_node;
for(int i = 0;i < size;i++){
if(i==0){
pre_node = que.front();
que.pop();
cur_node = pre_node;
}
else{
cur_node = que.front();
que.pop();
pre_node->next = cur_node;
pre_node = pre_node->next;
}
if(cur_node->left!=nullptr) que.push(cur_node->left);
if(cur_node->right!=nullptr) que.push(cur_node->right);
}
pre_node->next = nullptr;
}
return root;
}
};
104.二叉树的最大深度
/**
* 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:
int maxDepth(TreeNode* root) {
queue<TreeNode*>que;
if(root!=nullptr) que.push(root);
int max_depth = 0;
while(!que.empty()){
int size = que.size();
max_depth++;
for(int i = 0;i<size;i++){
TreeNode *cur = que.front();
que.pop();
if(cur->left!=nullptr) que.push(cur->left);
if(cur->right!=nullptr) que.push(cur->right);
}
}
return max_depth;
}
};
111.二叉树的最小深度
/**
* 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:
int minDepth(TreeNode* root) {
queue<TreeNode *>que;
if(root!=nullptr) que.push(root);
int mindepth = 0;
while(!que.empty()){
mindepth++;
int size = que.size();
for(int i = 0;i < size;i++){
TreeNode *cur = que.front();
que.pop();
if(cur->left!=nullptr) que.push(cur->left);
if(cur->right!=nullptr) que.push(cur->right);
if(cur->left==nullptr&&cur->right==nullptr) return mindepth;
}
}
return mindepth;
}
};