想法: 用1个NULL指针作为标记
code(后序)
/**
* 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>result;
if(root==NULL)return result;
stack<TreeNode*>st;
st.push(root);
while(!st.empty())
{
TreeNode*cur=st.top();
if(cur)
{
st.push(NULL);
if(cur->right)st.push(cur->right);
if(cur->left)st.push(cur->left);
}
else
{
st.pop();
cur=st.top();
st.pop();
result.push_back(cur->val);
}
}
return result;
}
};