midtorder/preorder/postorder

题目一：midorder

vector<int> midorderTraversal(TreeNode *root) {
     vector<int> res;
     if(root==NULL) return res;
     TreeNode *p=root;
     stack<TreeNode*> stk;
     while(p || !stk.empty())
     {
         if(p)
         {
             stk.push(p);
             p=p->left;
         }
         else
         {
             TreeNode *q=stk.top();
             res.push_back(q->val);
             stk.pop();
             if(q->right)
             {
                 p=q->right;
                 stk.push(p);//这两句可以没有
                 p=p->left;//这两句可以没有
             }
             else
                 p=NULL;
         }
     }
     return res;

注：斜线注释的那两行可以不要；第18-25行可以用一句话代替：p=q->right;

题目二：preorder

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
         vector<int> res;
        stack<TreeNode *> stk;
        if(root==NULL)
            return res;
        while(root || !stk.empty())
        {
            if(root)
            {
                res.push_back(root->val);
                stk.push(root);
                root=root->left;
            }
            else{
                TreeNode *p=stk.top();
                stk.pop();
                if(p->right)
                {
                    root=p->right;
                }
                else
                    root=NULL;//这句话可以没有
            }
        }
        return res;
    }
};

题目三：postorder

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> postorderTraversal(TreeNode *root) {
        vector<int> res;
        stack<TreeNode *> stk;
        if(root==NULL)
            return res;
        TreeNode *r=NULL;
        while(root || !stk.empty())
        {
            if(root)
            {
                stk.push(root);
                root=root->left;
            }
            else
            {
                TreeNode *p=stk.top();
                if(p->right && p->right!=r)
                {
                    root=p->right;
                }
                else
                {
                    res.push_back(p->val);
                    stk.pop();
                    r=p;
                    root=NULL;//这句可以没有
                }
            }
        }
        return res;
    }
};