层序遍历与226.翻转二叉树
使用队列,将每一层的元素入队,并记录每层元素个数,再该层每一个元素从队头出队时将其子节点从队尾入队,这样当上层元素全部出队后,其下层元素全部入队,重复上述操作,直到队列为空。下边11道题均可以使用该方法解决。
给你二叉树的根节点 root
,返回其节点值的 层序遍历 。 (即逐层地,从左到右访问所有节点)。
/**
* 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>> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return result;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(sub_res);
sub_res.clear();
}
}
return result;
}
};
给你二叉树的根节点 root
,返回其节点值 自底向上的层序遍历 。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
/**
* 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) {
vector<vector<int>> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return result;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(sub_res);
sub_res.clear();
}
}
reverse(result.begin(),result.end());
return result;
}
};
给定一个二叉树的 根节点 root
,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
/**
* 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) {
vector<int> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return result;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(*(sub_res.end()-1));
sub_res.clear();
}
}
return result;
}
};
给定一个非空二叉树的根节点 root
, 以数组的形式返回每一层节点的平均值。与实际答案相差 10-5
以内的答案可以被接受。
/**
* 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:
double getAverage(vector<int> v)
{
double sum = 0;
for(int i = 0;i<v.size();i++)
{
sum += v[i];
}
return sum/v.size();
}
vector<double> averageOfLevels(TreeNode* root) {
vector<double> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return result;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(getAverage(sub_res));
sub_res.clear();
}
}
return result;
}
};
给定一个 N 叉树,返回其节点值的层序遍历。(即从左到右,逐层遍历)。
树的序列化输入是用层序遍历,每组子节点都由 null 值分隔(参见示例)。
/*
// 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) {
vector<vector<int>> result;
vector<int> sub_res;
queue<Node*> q;
int num;
if(root == NULL)return result;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
for(int i = 0;i<q.front()->children.size();i++)
{
q.push(q.front()->children[i]);
}
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(sub_res);
sub_res.clear();
}
}
return result;
}
};
给定一棵二叉树的根节点 root
,请找出该二叉树中每一层的最大值。
/**
* 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 getMax(vector<int> v)
{
if(v.empty()) return -1;
int Max = v[0];
for(int i = 1;i<v.size();i++)
{
Max = max(Max,v[i]);
}
return Max;
}
vector<int> largestValues(TreeNode* root) {
vector<int> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return result;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(getMax(sub_res));
sub_res.clear();
}
}
return result;
}
};
给定一个 完美二叉树 ,其所有叶子节点都在同一层,每个父节点都有两个子节点。二叉树定义如下:
struct Node { int val; Node *left; Node *right; Node *next; }
填充它的每个 next 指针,让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点,则将 next 指针设置为 NULL
。
初始状态下,所有 next 指针都被设置为 NULL
。
/*
// 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*> sub;
queue<Node*> q;
int num;
if(root == NULL)return root;
q.push(root);
num = q.size();
while(!q.empty())
{
sub.push(q.front());
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
Node* temp = sub.back();
temp->next = NULL;
while(sub.size()>1)
{
temp = sub.front();
sub.pop();
temp->next = sub.front();
}
if(sub.size()==1) sub.pop();
}
}
return root;
}
};
给定一个二叉树:
struct Node { int val; Node *left; Node *right; Node *next; }
填充它的每个 next 指针,让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点,则将 next 指针设置为 NULL
。
初始状态下,所有 next 指针都被设置为 NULL
。
/*
// 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*> sub;
queue<Node*> q;
int num;
if(root == NULL)return root;
q.push(root);
num = q.size();
while(!q.empty())
{
sub.push(q.front());
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
Node* temp = sub.back();
temp->next = NULL;
while(sub.size()>1)
{
temp = sub.front();
sub.pop();
temp->next = sub.front();
}
if(sub.size()==1) sub.pop();
}
}
return root;
}
};
给定一个二叉树 root
,返回其最大深度。
二叉树的 最大深度 是指从根节点到最远叶子节点的最长路径上的节点数。
/**
* 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) {
vector<vector<int>> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return 0;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(sub_res);
sub_res.clear();
}
}
return result.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:
int minDepth(TreeNode* root) {
vector<vector<int>> result;
vector<int> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return 0;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front()->val);
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
if(q.front()->left == NULL && q.front()->right == NULL) return result.size()+1;
q.pop();
num--;
if(num == 0)
{
num = q.size();
result.push_back(sub_res);
sub_res.clear();
}
}
return result.size();
}
};
给你一棵二叉树的根节点 root
,翻转这棵二叉树,并返回其根节点。
示例 1:
/**
* 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:
TreeNode* invertTree(TreeNode* root) {
//vector<vector<int>> result;
vector<TreeNode*> sub_res;
queue<TreeNode*> q;
int num;
if(root == NULL)return root;
q.push(root);
num = q.size();
while(!q.empty())
{
sub_res.push_back(q.front());
if(q.front()->left != NULL)q.push(q.front()->left);
if(q.front()->right != NULL)q.push(q.front()->right);
q.pop();
num--;
if(num == 0)
{
num = q.size();
TreeNode* temp;
for(int i = 0;i<sub_res.size();i++)
{
if(sub_res[i]->left) temp = sub_res[i]->left;
else temp = NULL;
if(sub_res[i]->right) sub_res[i]->left = sub_res[i]->right;
else sub_res[i]->left = NULL;
sub_res[i]->right = temp;
}
sub_res.clear();
}
}
return root;
}
};
101. 对称二叉树
给你一个二叉树的根节点 root
, 检查它是否轴对称。
/**
* 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:
bool subSymmetric(TreeNode* T1,TreeNode* T2)
{
bool b1 = true;
bool b2 = true;
if(T1->val == T2->val)
{
if(T1->left == NULL && T1->right == NULL && T2->left == NULL && T2->right == NULL) return true;
else
{
if(T1->left != NULL && T2->right != NULL)b1 = subSymmetric(T1->left,T2->right);
else if((T1->left == NULL && T2->right != NULL)||(T1->left != NULL && T2->right == NULL)) return false;
if(T2->left != NULL && T1->right != NULL)b2 = subSymmetric(T2->left,T1->right);
else if((T2->left == NULL && T1->right != NULL)||(T2->left != NULL && T1->right == NULL)) return false;
if(b1 && b2) return true;
}
}
return false;
}
bool isSymmetric(TreeNode* root) {
if(root == NULL) return true;
if(!(root->left||root->right)) return true;
if((root->left == NULL && root->right != NULL)||(root->left != NULL && root->right == NULL)) return false;
if(root->left->val != root->right->val) return false;
return subSymmetric(root->left,root->right);
}
};
虽然解出来了,但是思路并不系统,根据不同情况的问题才更改完善的。