代码随想录算法训练营第十三天|94. 二叉树的中序遍历、145. 二叉树的后序遍历、144. 二叉树的前序遍历

题目链接：144. 二叉树的前序遍历

递归法：

/**
 * 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>result;
        traversal(root, result);
        return result;
    }

    void traversal(TreeNode* curr, vector<int> &vec) {
        if(curr == nullptr) return;

        vec.push_back(curr->val);
        traversal(curr->left, vec);
        traversal(curr->right, vec);
    }
};

迭代法：

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

题目链接：94. 二叉树的中序遍历

递归：

/**
 * 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> result;
        traversal(root, result);
        return result;
    }

    void traversal(TreeNode* curr, vector<int> &vec) {
        if (curr == nullptr) return;

        traversal(curr->left, vec);
        vec.push_back(curr->val);
        traversal(curr->right, vec);
    }
};

迭代：

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

题目链接：145. 二叉树的后序遍历

递归

/**
 * 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> result;
        traversal(root, result);
        return result;
    }

    void traversal(TreeNode* curr, vector<int> &vec) {
        if(curr == nullptr) return;

        traversal(curr->left, vec);
        traversal(curr->right, vec);
        vec.push_back(curr->val);
    }
};

迭代：

/**
 * 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> vec;
        stack<TreeNode*> stk;
        stk.push(root);
        while(!stk.empty()) {
            TreeNode* node = stk.top();
            stk.pop();
            if(node != nullptr) vec.push_back(node->val);
            else continue;
            stk.push(node->left);
            stk.push(node->right);
        }
        if(!vec.empty()) reverseArry(vec);
        return vec;
    }

    void reverseArry(vector<int> &vec) {
        for(size_t i = 0, j = vec.size() - 1; i < j; i++, j--) {
            swap(vec[i], vec[j]);
        }
    }
};