递归遍历
思路:递归三要素:确定参数及返回值、终止条件、单层递归逻辑。前中后序的递归遍历只需要交换单层递归中的操作顺序即可。
144. 二叉树的前序遍历
题解:
class Solution {
public:
void traversal(TreeNode* root, vector<int> &vec)
{
if (root == nullptr)
return;
vec.push_back(root->val);
traversal(root->left, vec);
traversal(root->right, vec);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
traversal(root, res);
return res;
}
};
145. 二叉树的后序遍历
题解:
class Solution {
public:
void traversal(TreeNode* root, vector<int> &vec)
{
if (root == nullptr)
return;
traversal(root->left, vec);
traversal(root->right, vec);
vec.push_back(root->val);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
traversal(root, res);
return res;
}
};
94. 二叉树的中序遍历
题解:
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> res;
traversal(root, res);
return res;
}
};
589. N叉树的前序遍历
题解:
class Solution {
public:
void traversal(Node* root, vector<int> &vec)
{
if (root == nullptr) return;
vec.push_back(root->val);
for (auto it : root->children)
traversal(it, vec);
}
vector<int> preorder(Node* root) {
vector<int> res;
traversal(root, res);
return res;
}
};
590,N 叉树的后序遍历
题解:
class Solution {
public:
void traversal(Node* root, vector<int> &vec)
{
if (root == nullptr) return;
for (auto it : root->children)
traversal(it, vec);
vec.push_back(root->val);
}
vector<int> postorder(Node* root) {
vector<int> res;
traversal(root, res);
return res;
}
};
迭代遍历
思路:访问节点从根节点开始,前序遍历和后序遍历(左右中=reverse(中右左))处理节点和访问节点是相同的,而中序遍历不同,比较特殊,由于是用栈模拟递归,要考虑栈先进后出的特性,注意元素的存入顺序。
144. 二叉树的前序遍历
题解:
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> res;
if (root == nullptr)
return res;
st.push(root);
while(!st.empty())
{
TreeNode *node = st.top();
res.push_back(node->val);
st.pop();
if (node->right) st.push(node->right);
if (node->left) st.push(node->left);
}
return res;
}
};
145. 二叉树的后序遍历
题解:
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> res;
if (root == nullptr)
return res;
st.push(root);
while(!st.empty())
{
TreeNode *node = st.top();
res.push_back(node->val);
st.pop();
if (node->left) st.push(node->left);
if (node->right) st.push(node->right);
}
reverse(res.begin(), res.end());
return res;
}
};
94. 二叉树的中序遍历
题解:
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> res;
TreeNode *cur = root;
while (cur != nullptr || !st.empty())
{
if (cur != nullptr)
{
st.push(cur);
cur = cur -> left;
}
else
{
cur = st.top();
res.push_back(cur->val);
st.pop();
cur = cur->right;
}
}
return res;
}
};
统一迭代
思路:为了处理访问节点和处理节点不同的问题,我们把访问节点和处理节点都压入栈中,但在处理节点后多压入一个nullptr,打上标记,遇见标记才进行处理。
144. 二叉树的前序遍历
题解:
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> res;
if (root != nullptr) st.push(root);
while(!st.empty())
{
TreeNode *node = st.top();
if (node != nullptr)
{
st.pop();
if(node->right) st.push(node->right);
if(node->left) st.push(node->left);
st.push(node);
st.push(nullptr);
}
else
{
st.pop();
node = st.top();
res.push_back(node->val);
st.pop();
}
}
return res;
}
};
145. 二叉树的后序遍历
题解:
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> res;
if (root != nullptr) st.push(root);
while(!st.empty())
{
TreeNode *node = st.top();
if (node != nullptr)
{
st.pop();
st.push(node);
st.push(nullptr);
if (node->right) st.push(node->right);
if (node->left) st.push(node->left);
}
else
{
st.pop();
node = st.top();
res.push_back(node->val);
st.pop();
}
}
return res;
}
}
94. 二叉树的中序遍历
题解:
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> res;
if (root != nullptr) st.push(root);
while(!st.empty())
{
TreeNode* node = st.top();
if (node != nullptr)
{
st.pop();
if(node->right) st.push(node->right);
st.push(node);
st.push(nullptr);
if(node->left) st.push(node->left);
}
else
{
st.pop();
node = st.top();
res.push_back(node->val);
st.pop();
}
}
return res;
}
};
层序遍历
思路:一层一层遍历和queue先进先出的特性吻合,注意每层遍历时,栈内元素的数目会变换,我们需要提前记录每层元素的数目。
102. 二叉树的层序遍历
题解:
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> que;
vector<vector<int>> res;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
vector<int> subres;
for(int i=0; i<size; ++i)
{
TreeNode* node = que.front();
que.pop();
subres.push_back(node->val);
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
res.push_back(subres);
}
return res;
}
};
107.二叉树的层次遍历II
题解:
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
queue<TreeNode*> que;
vector<vector<int>> res;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
vector<int> subres;
for(int i = 0; i < size; ++i)
{
TreeNode* node = que.front();
que.pop();
subres.push_back(node->val);
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
res.push_back(subres);
}
reverse(res.begin(), res.end());
return res;
}
};
199.二叉树的右视图
题解:
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
queue<TreeNode*> que;
vector<int> res;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
res.push_back(que.back()->val);
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 res;
}
};
637.二叉树的层平均值
题解:
class Solution {
public:
vector<double> averageOfLevels(TreeNode* root) {
queue<TreeNode*> que;
vector<double> res;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
long long 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);
}
double subres = (double) sum / size;
res.push_back(subres);
}
return res;
}
};
429.N叉树的层序遍历
题解:
class Solution {
public:
vector<vector<int>> levelOrder(Node* root) {
queue<vector<Node*>> que;
vector<vector<int>> res;
if (root != nullptr) que.push(vector<Node*>{root});
while(!que.empty())
{
int size = que.size();
vector<int> subres;
for (int i=0; i<size; ++i)
{
vector<Node*> children = que.front();
for (int j=0; j<children.size(); ++j)
{
subres.push_back(children[j]->val);
if (!(children[j]->children).empty()) que.push(children[j]->children);
}
que.pop();
}
res.push_back(subres);
}
return res;
}
};
515.在每个树行中找最大值
题解:
class Solution {
public:
vector<int> largestValues(TreeNode* root) {
queue<TreeNode*> que;
vector<int> res;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
int max = INT_MIN;
for (int i=0; i<size; ++i)
{
TreeNode *node = que.front();
max = max > (node->val) ? max : (node->val);
que.pop();
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
res.push_back(max);
}
return res;
}
};
116.填充每个节点的下一个右侧节点指针
题解:
class Solution {
public:
Node* connect(Node* root) {
queue<Node*> que;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
for (int i = 0; i < size; ++i)
{
Node* node = que.front();
que.pop();
node -> next = i == size - 1? nullptr : que.front();
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return root;
}
};
117.填充每个节点的下一个右侧节点指针II
题解:
class Solution {
public:
Node* connect(Node* root) {
queue<Node*> que;
if (root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
for (int i = 0; i < size; ++i)
{
Node* node = que.front();
que.pop();
node -> next = i == size - 1? nullptr : que.front();
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return root;
}
};
104.二叉树的最大深度
题解:
class Solution {
public:
int maxDepth(TreeNode* root) {
queue<TreeNode*> que;
int res{0};
if(root != nullptr) que.push(root);
while(!que.empty())
{
int size = que.size();
++res;
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 res;
}
};
111.二叉树的最小深度
题解:
class Solution {
public:
int minDepth(TreeNode* root) {
queue<TreeNode*> que;
int depth{0};
if (root != nullptr) 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 && !node->right) return depth;
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return depth;
}
};