144. 二叉树的前序遍历、94. 二叉树的中序遍历、145. 二叉树的后序遍历

题目：实现二叉树的前序遍历、中序遍历和后序遍历。

前序遍历：首先访问根结点，然后遍历左子树，最后遍历右子树（根->左->右）。

中序遍历：首先遍历左子树，然后访问根节点，最后遍历右子树（左->根->右）。

后序遍历：首先遍历左子树，然后遍历右子树，最后访问根节点（左->右->根）。

解法1：递归

C++实现如下：

前序遍历

/**
 * 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> preorderTraversal(TreeNode* root) {
        vector<int> res;
        preorder(root,res);
        return res;
    }
    void preorder(TreeNode *root,vector<int> &res)
    {
        if(root==NULL)
            return;
        res.push_back(root->val);
        preorder(root->left,res);
        preorder(root->right,res);
    }
};

中序遍历

/**
 * 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> inorderTraversal(TreeNode* root) {
        vector<int> res;
        inorder(root,res);
        return res;
    }
    void inorder(TreeNode *root,vector<int> &res)
    {
        if(root==nullptr)
            return;
        inorder(root->left,res);
        res.push_back(root->val);
        inorder(root->right,res);
    }
};

后序遍历

/**
 * 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) {
      vector<int> res;
      posorder(root,res);
      return res;  
    }
    void posorder(TreeNode *root,vector<int> &res)
    {
        if(root==NULL)
            return;
        posorder(root->left,res);
        posorder(root->right,res);
        res.push_back(root->val);
        
    }
};

解法2：迭代前序遍历

/**
 * 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> preorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==nullptr)
            return res;
        stack<TreeNode *> stk;
        TreeNode *node=root;
        while(node||!stk.empty())
        {
            while(node)
            {
                res.push_back(node->val);
                stk.emplace(node);
                node=node->left;
            }
            node=stk.top();
            stk.pop();
            node=node->right;
        }
        return res;
    }
};

中序遍历

/**
 * 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> inorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==nullptr)
            return res;
        stack<TreeNode *> stk;
        TreeNode *node=root;
        while(node||!stk.empty())
        {
            while(node)
            {
                stk.emplace(node);
                node=node->left;
            }
            node=stk.top();
            res.push_back(node->val);
            stk.pop();
            node=node->right;
        }
        return res;
    }
};

后序遍历

/**
 * 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) {
        vector<int> res;
        if(root==nullptr)
            return res;
        stack<TreeNode *> stk;
        TreeNode *node=root;
        TreeNode *prev = nullptr;
        while(node||!stk.empty())
        {
            while(node)
            {
                stk.emplace(node);
                node=node->left;
            }
            node=stk.top();
            stk.pop();
            if(node->right==nullptr||node->right==prev)
            {
                res.push_back(node->val);
                prev=node;
                node=nullptr;
            }
            else
            {
                stk.emplace(node);
                node=node->right;
            }

        }
        return res;
        
    }
};

后序遍历的顺序是左右中，前序遍历的顺序是中左右，所以我们可以调节前序遍历的代码使之变为中右左然后反转结果数组即可实现后序遍历。

C++实现如下：

/**
 * 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) {
        vector<int> res;
        if(root==NULL)
            return res;
        stack<TreeNode *> temp;
        TreeNode *node=root;
        while(node||!temp.empty())
        {
            while(node)
            {
                res.push_back(node->val);
                temp.emplace(node);
                node=node->right;
            }
            node=temp.top();
            temp.pop();
            node=node->left;
        }
        reverse(res.begin(),res.end());
        return res;
        
    }
};