二叉树的迭代遍历

以前遍历二叉树都是用递归进行遍历，导致要用迭代遍历的时候总是要想很久，特在此对二叉树的迭代遍历进行记录。

前序遍历

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

习惯了递归写法，发现前面的迭代遍历写法上，三种遍历的写法上不统一，接下来记录一下迭代且类似的三种遍历方法。

前序遍历2

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

中序遍历2

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

后序遍历2

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