LeetCode 二叉树遍历非递归实现

先序遍历

/**
 * Definition for a binary tree node.
 * 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;
        if(!root) 
            return res;
        stack<TreeNode*> st;
        TreeNode* p = root; 
        while(!st.empty() || p){ 
            if(p){
                st.push(p); 
                res.push_back(node->val);
                p = p->left;
            } else {
                TreeNode *t = s.top();
                s.pop(); 
                p = t->right;
            } 
        } 
        return res;
    }
};

中序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
       vector<int> ret;
        if(!root) 
            return ret;
        stack<TreeNode*> st;
        TreeNode* pNode = root;
        while(!st.empty() || pNode) {
            if(pNode){
                st.push(pNode);
                pNode = pNode->left;
            }else{
                TreeNode *t = st.top();
                st.pop();
                ret.push_back(t->val);
                pNode = t->right;
            }
        }
        return ret;
    }
};

后序遍历

/**
 * Definition for a binary tree node.
 * 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> ret;
        if(!root) 
            return ret;
        stack<TreeNode*> st;
        TreeNode* pNode = root;
        while(!st.empty() || pNode) {
            if(pNode){
                st.push(pNode);
                ret.insert(ret.begin(), pNode->val);
                pNode = pNode->right;
            }else{
                TreeNode *t = st.top();
                st.pop();
                pNode = t->left;
            }
        }
        return ret;
    }
};