https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
思路:非递归版,这个思路对于前序遍历、中序遍历也适用。左右根,首先获得栈顶,然后判断栈顶是否为空,若不为空,则再次压入该节点,同时压入一个空指针,标记其前一位为根节点,然后压入它右节点、左节点;若栈顶为空,说明前一位也就是当前的栈顶为根节点,那么把它的值放进数组中即可。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> ans;
if(root==NULL)
return ans;
stack<TreeNode*> stk;
stk.push(root);
TreeNode *cur;
while(!stk.empty()){
cur=stk.top();
stk.pop();
if(cur){
stk.push(cur);
stk.push(NULL);
if(cur->right)
stk.push(cur->right);
if(cur->left)
stk.push(cur->left);
}
else{
ans.push_back(stk.top()->val);
stk.pop();
}
}
return ans;
}
};