🔥个人主页:guoguoqiang. 🔥专栏:leetcode刷题
二叉树的前序遍历
/**
* 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> preorderTraversal(TreeNode* root) {
stack<TreeNode*> s;
vector<int> v;
TreeNode* cur=root;
while(cur||!s.empty()){//
while(cur){//找左树,然后遇到空停止
v.push_back(cur->val);
s.push(cur);
cur=cur->left;
}
TreeNode* top=s.top();
s.pop();
cur=top->right;//找这个节点的右树
}
return v;
}
};
二叉树的中序遍历
/**
* 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> inorderTraversal(TreeNode* root) {
stack<TreeNode*> s;
vector<int> v;
TreeNode* cur=root;
while(cur||!s.empty()){
while(cur){
s.push(cur);
cur=cur->left;
}
TreeNode* top=s.top();
v.push_back(top->val);
s.pop();
cur=top->right;
}
return v;
}
};
二叉树的后续遍历
/**
* 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> postorderTraversal(TreeNode* root) {
TreeNode* cur=root;
stack<TreeNode*> s;
vector<int> v;
TreeNode* prev=nullptr;
while(cur||!s.empty()){
// 1、访问⼀颗树的开始
while(cur){
s.push(cur);
cur=cur->left;
}
TreeNode* top=s.top();
// top 结点的右为空 或者 上⼀个访问结点等于他的右孩⼦
// 那么说明 ( 空 ) 不⽤访问 或者 ( 不为空 ) 右⼦树已经访问过了
// 那么说明当前结点左右⼦树都访问过了,可以访问当前结点了
if(top->right==nullptr||top->right==prev){
s.pop();
v.push_back(top->val);
prev=top;
}
else{
cur=top->right;
}
}
return v;
}
};