迭代法实现前中后序遍历

144. Binary Tree Preorder Traversal

Given the root of a binary tree, return the preorder traversal of its nodes' values.

Example 1:

Input: root = [1,null,2,3]
Output: [1,2,3]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

Constraints:

• The number of nodes in the tree is in the range [0, 100].
• -100 <= Node.val <= 100

Follow up: Recursive solution is trivial, could you do it iteratively?

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int>result;
        stack<TreeNode*>stk;
        if(root==NULL)return result;
        stk.push(root);
        while(!stk.empty()){
            TreeNode*node=stk.top();
            stk.pop();
            result.push_back(node->val);
            if(node->right)stk.push(node->right);
            if(node->left)stk.push(node->left);
        }
        return result;
    }
};

94. Binary Tree Inorder Traversal

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int>result;
        stack<TreeNode*>stk;
        TreeNode*curr=root;
        while(curr!=NULL|| !stk.empty()){
            if(curr!=NULL){
                stk.push(curr);
                curr=curr->left;
            }
            else{
                curr=stk.top();
                stk.pop();
                result.push_back(curr->val);
                curr=curr->right;
            }
        }
        return result;
    }
};

145. Binary Tree Postorder Traversal

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

总体思路：