二叉后序遍历的两种写法

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

vector<int> postorderTraversal(TreeNode* root) {
        TreeNode *cur =root;
        stack<TreeNode*> myStack;
        vector<int> res;
        while(cur||!myStack.empty())
        {
            if(cur)
            {
                res.push_back(cur->val);
                myStack.push(cur);
                cur=cur->right;
            }
            else 
            {
                cur=myStack.top()->left;
                myStack.pop();
            }
        }
        reverse(res.begin(),res.end());
        return res;
    }