二叉树后序遍历

代码检测：leetcode

方法1：递归

class Solution {
public:
    vector<int> res;
    vector<int> postorderTraversal(TreeNode* root) {
        if(!root) return res;
        if(root->left) postorderTraversal(root->left);
        if(root->right) postorderTraversal(root->right);
        res.push_back(root->val);
        return res;
    }
};

 

方法2：非递归

用stack存再reverse

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        stack<TreeNode*> s;
        if(root==NULL) return res;
        s.push(root);
        while(!s.empty()){
            TreeNode* now = s.top();
            s.pop();
            res.push_back(now->val);
            if(now->left) s.push(now->left);
            if(now->right) s.push(now->right);
        } 
        reverse(res.begin(),res.end());
        return res;
    }
};