Day12 二叉树的遍历

1.前序遍历 LeetCode 144

1）递归法

class Solution {
public:
    vector<int> res;
    vector<int> preorderTraversal(TreeNode* root) {
        if (root == nullptr) {
            return {};
        }
        res.push_back(root->val);
        preorderTraversal(root->left);
        preorderTraversal(root->right);
        return res;
    }
};

2）迭代法

class Solution {
public:
    vector<int> res;
    vector<int> preorderTraversal(TreeNode* root) {
        //迭代
        if (root == nullptr) {
            return {};
        }
        stack<TreeNode*> st;
        st.push(root);
        //入栈顺序   头->右->左
        while (!st.empty()) {
            root = st.top();
            res.push_back(root->val);
            st.pop();
            if (root->right) {
                st.push(root->right);
            }
            if (root->left) {
                st.push(root->left);
            }
        }
        return res;
    }
};

2.中序遍历 LeetCode 94

1）递归法

class Solution {
public:
    vector<int> res;
    vector<int> inorderTraversal(TreeNode* root) {
        //递归
        if (root == nullptr) {
            return {};
        }
        inorderTraversal(root->left);
        res.push_back(root->val);
        inorderTraversal(root->right);
        return res;
    }
};

2）迭代法

class Solution {
public:
    vector<int> res;
    vector<int> inorderTraversal(TreeNode* root) {
        //迭代
        if(root == nullptr) {
            return {};
        }
        stack<TreeNode*> st;
        //入栈顺序 头->左 
        while (!st.empty() || root!= nullptr) {
            if (root) {
                st.push(root);
                root = root->left;
            }else {
                root = st.top();
                st.pop();
                res.push_back(root->val);
                root = root->right;
            }
        }    
        return res;  
    }
};

3.后序遍历 LeetCode 145

1）递归法

class Solution {
public:
    vector<int> res;
    vector<int> postorderTraversal(TreeNode* root) {
        if (root == nullptr) {
            return res;;
        }
        postorderTraversal(root->left);
        postorderTraversal(root->right);
        res.push_back(root->val);
        return res;
    }
};

2）迭代法

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        if (root == nullptr) {
            return res;
        }
        stack<TreeNode*> st;
        st.emplace(root);
        while(!st.empty()) {
            root = st.top();
            st.pop();
            res.emplace_back(root->val);
            if (root->left) {
                st.push(root->left);
            }
            if (root->right) {
                st.emplace(root->right);
            }
        }
        reverse(res.begin(), res.end());
        return res;
    }
};