二叉树的后序遍历（栈实现）

题目：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 postorderTraversal(TreeNode* root) {
        vector res;
        if(root == nullptr) return res;
        stack st;
        st.push(root);
        while(!st.empty()) {
            TreeNode *cur = st.top();
            st.pop();
            if(cur->left == nullptr && cur->right == nullptr) {
                res.push_back(cur->val);
            }else {
                TreeNode *l = cur->left;
                TreeNode *r = cur->right;
                cur->left = cur->right = nullptr;
                st.push(cur);
                if(r != nullptr) st.push(r);
                if(l != nullptr) st.push(l);
            }
        }
        return res;
    }
};