144 二叉树的前序遍历|145 二叉树的后序遍历|94 二叉树的中序遍历
题目链接:https://leetcode.cn/problems/binary-tree-preorder-traversal/description/
题目链接:https://leetcode.cn/problems/binary-tree-postorder-traversal/description/
题目链接:https://leetcode.cn/problems/binary-tree-inorder-traversal/description/
思路:中左右,左右中,左中右
/**
* 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:
void traversal(TreeNode* cur,vector<int>& vec){
if(cur == nullptr)
return;
//确定单层遍历逻辑
vec.push_back(cur->val);
traversal(cur->left, vec);
traversal(cur->right, vec);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
traversal(root,result);
return result;
}
};
/**
* 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:
void traversal(TreeNode* cur, vector<int>& vec){
if(cur == nullptr)
return;
traversal(cur->left, vec);
traversal(cur->right, vec);
vec.push_back(cur->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> result;
traversal(root, result);
return result;
}
};
/**
* 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:
void traversal(TreeNode* cur, vector<int>& vec){
if(cur == nullptr)
return;
traversal(cur->left, vec);
vec.push_back(cur->val);
traversal(cur->right, vec);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
traversal(root, result);
return result;
}
};
102 二叉树的层序遍历
题目链接:https://leetcode.cn/problems/binary-tree-level-order-traversal/description/
思路:由队列先进先出特性完成广度优先搜索遍历,队列的size很重要,弹出size个元素标志二叉树每层有多少个元素。
/**
* 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()){
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);
}
return result;
}
};
107 二叉树的层序遍历||
题目链接:https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/description/
思路:反转result数组得自底向上的层序遍历
/**
* 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()){
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()); //反转result数组得自底向上遍历
return result;
}
};
199 二叉树的右视图
题目链接:https://leetcode.cn/problems/binary-tree-right-side-view/
思路:判断是否遍历到单层的最后面的元素,如果是,就放进result数组中,最后返回result。
/**
* 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* node = que.front();
que.pop();
if(i == (size - 1))
result.push_back(node->val); //将每一层最后元素放入result数组中
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
}
return result;
}
};
637 二叉树的层平均值
题目链接:https://leetcode.cn/problems/average-of-levels-in-binary-tree/description/
思路:统计每层的和再求均值并放进结果集。
/**
* 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* node = que.front();
que.pop();
sum += node->val;
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
result.push_back(sum / size); //对每层求总和再取一个均值,并将均值放进结果集。
}
return result;
}
};
429 N插叉树的层序遍历
https://leetcode.cn/problems/n-ary-tree-level-order-traversal/description/
/*
// 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;
if(root != nullptr )
que.push(root);
vector<vector<int>> result;
while (!que.empty()){
int size =que.size();
vector<int> vec;
for(int i = 0; i<size; i++){
Node* node =que.front();
que.pop();
vec.push_back(node->val);
for(int j = 0; j < node->children.size(); j++){
//将节点所有孩子加入队列
if(node->children[j])
que.push(node->children[j]);
}
}
result.push_back(vec);
}
return result;
}
};
515 在每个树行中找最大值
https://leetcode.cn/problems/find-largest-value-in-each-tree-row/description/
/**
* 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;
if(root != nullptr)
que.push(root);
vector<int> result;
while(!que.empty()){
int size = que.size();
int maxValue = INT_MIN; //取每一层的最大值
for(int i = 0; i< size; i++){ //每层进行一次循环
TreeNode*node = que.front();
que.pop();
maxValue = node->val > maxValue ? node->val : maxValue;
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
result.push_back(maxValue); //把最大值放入result数组
}
return result;
}
};
116|117 填充每个节点的下一个右侧节点指针1和2
https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/description/
https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/description/
/*
// 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!= NULL)
que.push(root);
while(!que.empty()){
int size = que.size();
Node* nodePre;
Node* node;
for(int i=0;i<size;i++)
{
if(i == 0){
nodePre = que.front(); //取出一层的头节点
que.pop();
node = nodePre;
}else{
node = que.front();
que.pop();
nodePre->next = node; //本层前一个节点next指向本节点
nodePre = nodePre->next; //将nodePre移动到下一个节点
}
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
nodePre->next = NULL; //本层最后一个节点指向null
}
return root;
}
};
/*
// 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!= NULL)
que.push(root);
while(!que.empty()){
int size = que.size();
Node* nodePre;
Node* node;
for(int i=0;i<size;i++)
{
if(i == 0){
nodePre = que.front(); //取出一层的头节点
que.pop();
node = nodePre;
}else{
node = que.front();
que.pop();
nodePre->next = node; //本层前一个节点next指向本节点
nodePre = nodePre->next; //将nodePre移动到下一个节点
}
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
nodePre->next = NULL; //本层最后一个节点指向null
}
return root;
}
};
104 二叉树的最大深度
题目链接:https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/
思路:最大的深度就是二叉树的层数。
/**
* 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) {
if(root == nullptr)
return 0;
int depth = 0;
queue<TreeNode*> que;
que.push(root);
while(!que.empty()){
int size = que.size();
depth++;
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);
}
}
return depth;
}
};
111 二叉树的最小深度
题目链接:https://leetcode.cn/problems/minimum-depth-of-binary-tree/description/
思路:当左右孩子为空的时候可以判定,这是遍历的叶子结点了,也就是最小深度。
/**
* 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) {
if(root == nullptr)
return 0;
int depth = 0;
queue<TreeNode*> que;
que.push(root);
while(!que.empty()){
int size = que.size();
depth++; //记录最小深度
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(!node->left && !node->right) //左右孩子都为空说明就是最低点了
return depth;
}
}
return depth;
}
};