代码随想录算法训练营第十二天| 递归遍历 、迭代遍历、统一迭代

二叉树

---

一、递归遍历

按照遍历顺序输出

/**
 * 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:
    //递归写法
    void traversal(TreeNode* root, vector<int>&result) {
        if (root == nullptr) return;
        //前序遍历，中左右
        result.push_back(root->val);
        traversal(root->left, result);
        traversal(root->right, result);
        //中序遍历，左中右
        traversal(root->left, result);
        result.push_back(root->val);
        traversal(root->right, result);
        //后序遍历，左右中
        traversal(root->left, result);
        traversal(root->right, result);
        result.push_back(root->val); 
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int>result;
        traversal(root, result);
        return result;
    }
};

二、迭代遍历

1.使用栈实现，前序和后序一个思路，要访问的节点和处理的节点一致
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> preorderTraversal(TreeNode* root) {
        //栈实现
        vector<int>result;
        stack<TreeNode*>tree;
        if (root == nullptr) return result;
        tree.push(root);
        while (!tree.empty()) {
            TreeNode* node = tree.top();
            tree.pop();
            result.push_back(node->val);
            if (node->right) tree.push(node->right);
            if (node->left) tree.push(node->left);
        }
        return result;
    }
};

中序遍历，借用指针的遍历来帮助访问节点，栈则用来处理节点上的元素

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

三、统一迭代

不太容易理解，暂时放下

---

总结

二叉树的题目有固定的模板，有些题目只需改动处理节点部分
学习时间90min。
学习资料：《代码随想录》。