在这里插入代码片
/**
* 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) {
vector<int> res;
if(!root){
return res;
}
stack<TreeNode*> stk;
TreeNode* node=nullptr;
while(root!=nullptr || !stk.empty()){
while(root!=nullptr){
stk.emplace(root);
root=root->left;
}
root=stk.top();
stk.pop();
if(root->right==nullptr || root->right==node){//当该节点为叶子节点或者被访问过时,直接推入数组;
res.emplace_back(root->val);
node=root;
root=nullptr;
}
else{
//不是叶子节点且没有被访问过值,则推入栈中
stk.emplace(root);
root=root->right;
}
}
return res;
}
};