leetcode145. 二叉树的后序遍历

/**
 * 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) {
        //声明一个栈用来实现后续遍历
        stack<TreeNode*> st;
        //数组用来存储结果
        vector<int> result;
        //退出机制
        if(root == NULL) return result;
        //根节点入栈
        st.push(root);
        while(!st.empty()){
            TreeNode* node = st.top();//栈顶元素指针
            st.pop();//栈顶元素依次出栈；
            result.push_back(node->val);//出栈元素用result接收
            if(node->left) st.push(node->left);
            if(node->right) st.push(node->right);//先左右

        }
        reverse(result.begin(),result.end());//结果翻转
        return result;
    }
};