算法(二叉树)——二叉树的迭代遍历

---

1.前序遍历

    之前我们在迭代法中已经介绍了，每一次调用函数就是将相关的参数、场景保存到栈中，返回时再重新调用。那么我们可以自己定义一个栈，将元素按一定的顺序入栈，让他们按规则出栈，以达到前序遍历的目的。

/**
 * 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;
        stack<TreeNode*> st;
        if(root == nullptr)
        {
            return res;
        }
        st.push(root);
        while(!st.empty())
        {
            TreeNode* cur;
            cur = st.top();
            st.pop();
            res.push_back(cur->val);
            if(cur->right)
            {
                st.push(cur->right);
            }
            if(cur->left)
            {
                st.push(cur->left);
            }
        }
        return res;
    }
};

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

3.后序遍历

    后序遍历的代码和前序类似，只需要做出微调即可。

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