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

day14 记录代码随想录

递归遍历

第一题 力扣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) {}
 * };
 */

/*写一下链表：
struct TreeNode{
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x): val(x) , left(NULL) , right(NULL) {}

}
*/
 //二叉树深度优先递归
class Solution {
public:
    void traversal(TreeNode * root , vector<int>& result) {
        if( root == NULL)
            return;
        result.push_back(root->val);
        traversal(root->left, result);
        traversal(root->right, result);
    }

    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> result;
        traversal(root,result);
        return result;
    }
};

第二题 力扣145 二叉树的后序遍历

题目链接：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) {}
 * };
 */
 /*写一下链表结构体
struct TreeNode{
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
*/
 //深度优先递归后序遍历
class Solution {
public:
    void traversal( TreeNode* root , vector<int>& result) {
        if(root == NULL) return;
        traversal(root->left,result);
        traversal(root->right,result);
        result.push_back(root->val);
    }

    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> result;
        traversal(root,result);
        return result;
    }
};

第二题 力扣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) {}
 * };
 */
/*写一下链表结构体
struct TreeNode{
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
*/
 //二叉树中序遍历，深度优先递归算法
class Solution {
public:
    void traversal(TreeNode* root, vector<int>& result) {
        if(root == NULL) return;
        traversal(root->left,result);
        result.push_back(root->val);
        traversal(root->right,result);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;
        traversal(root,result);
        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) {}
 * };
 */
//写一下链表
/*
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> result;
        stack<TreeNode*> st;
        if (root == NULL)   return result;
        st.push(root);
        while(!st.empty()) {
            TreeNode* node;
            node = st.top();
            st.pop();
            result.push_back(node->val);
            if(node->right) st.push(node->right);
            if(node->left) st.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) {}
 * };
 */
//写一下链表
struct tree{
    int val;
    tree* left;
    tree* right;
    tree(int x) : val(x) , left(NULL), right(NULL) {}
};

 //迭代的后序遍历
class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> result;
        stack<TreeNode*> st;
        if(root == NULL)    return result;
        st.push(root);
        while(!st.empty()) {
            TreeNode* node = st.top();
            st.pop();
            if(node->left) st.push(node->left);
            if(node->right) st.push(node->right);
            result.push_back(node->val);
        }
        reverse(result.begin(),result.end());
        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*> st;
        TreeNode* cur = root;
        while( (cur != NULL) || !st.empty() ) {
            if(cur != NULL) {       //一直访问左边，直到底部为止
                st.push(cur);
                cur = cur->left;
            }
            else {
                cur = st.top();     //中
                st.pop();
                result.push_back(cur->val); 
                cur = cur->right;       //右
            }
        }
        return  result;
    }
};