前序:https://leetcode.cn/problems/binary-tree-preorder-traversal/
误打误撞做出来了
1
2 3
4 5 6 7
这个二叉树为例子,就是先1,2, 4,4没有右孩子,到2,2有右孩子,到5
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
stack<TreeNode*>sta;
vector<int>res;
while(root || !sta.empty()){
while(root){
sta.push(root);
res.push_back(root->val);
root = root->left;
}
root = sta.top();
sta.pop();
root = root->right;
}
return res;
}
};
中序遍历https://leetcode.cn/problems/binary-tree-inorder-traversal/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> stk;
while (root != nullptr || !stk.empty()) {
while (root != nullptr) {
stk.push(root);
root = root->left;
}
root = stk.top();
stk.pop();
res.push_back(root->val);
root = root->right;
}
return res;
}
};
后序遍历https://leetcode.cn/problems/binary-tree-postorder-traversal/
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
stack<TreeNode*>sta;
vector<int>res;
TreeNode* prev = nullptr;
while(root || !sta.empty()){
while(root){
sta.push(root);
root = root->left;
}
root = sta.top();
sta.pop();
if(root->right == nullptr || root->right == prev){
res.push_back(root->val);
prev = root;
root = nullptr;
}else{
sta.push(root);
root = root->right;
}
}
return res;
}
};