源码合集(day13 - day 18)

最新推荐文章于 2024-10-20 23:59:56 发布

map1e_zjc

最新推荐文章于 2024-10-20 23:59:56 发布

阅读量619

点赞数 10

文章标签：深度优先算法 c++ 数据结构

本文链接：https://blog.csdn.net/b1ankwall/article/details/141160344

版权

DAY13

力扣题

144.二叉树的前序遍历

题目链接:. - 力扣（LeetCode）

递归

class Solution {
public:
    void dfs(TreeNode *cur,vector<int> &nums)
    {
        if(cur == nullptr)return;
        nums.push_back(cur -> val);
        dfs(cur -> left, nums);
        dfs(cur -> right, nums);
    }
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int>result;
        dfs(root,result);
        return result;
    }
};

迭代

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int>result;
        if(root == nullptr) return result;
        TreeNode *p = root;
        stack<TreeNode*>s;
        while(p != nullptr || s.size())
        {
            while(p != nullptr)
            {
                s.push(p);
                result.push_back(p->val);
                p = p -> left;
            }
            if(s.size())
            {
                p = s.top();
                s.pop();
                p = p -> right;
            }
        }
        return result;
    }
};

94.二叉树的中序遍历

题目链接:. - 力扣（LeetCode）

递归

class Solution {
public:

    void dfs(TreeNode *cur, vector<int> &nums)
    {
        if(cur == nullptr) return;
        dfs(cur -> left, nums);
        nums.push_back(cur -> val);
        dfs(cur -> right, nums);
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int>reusult;
        dfs(root, reusult);
        return reusult;
    }
};

迭代

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int>result;
        if(root == nullptr) return result;
        TreeNode *p = root;
        stack<TreeNode*>s;
        while(p != nullptr || s.size())
        {
            while(p != nullptr)
            {
                s.push(p);
                p = p -> left;
            }
            if(s.size())
            {
                p = s.top();
                 result.push_back(p->val);
                s.pop();
                p = p -> right;
            }
        }
        return result;
    }
};

145.二叉树的后序遍历

题目链接:. - 力扣（LeetCode）

递归

class Solution {
public:
    void dfs(TreeNode *cur,vector<int> &nums)
    {
        if(cur == nullptr)return;
        dfs(cur -> left, nums);
        dfs(cur -> right, nums);
        nums.push_back(cur -> val);
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>result;
        dfs(root,result);
        return result;
    }
};

迭代

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>result;
        if(root == nullptr) return result;
        TreeNode *p = root;
        unordered_map<TreeNode *,bool>isfirst;
        stack<TreeNode*>s;
        while(p != nullptr || s.size())
        {
            while(p != nullptr)
            {
                s.push(p);
                isfirst[p] = true;
                p = p -> left;
            }
            if(s.size())
            {
                p = s.top();
                s.pop();
                if(isfirst[p])
                {
                    isfirst[p] = false;
                    s.push(p);
                    p = p -> right;
                }
                else 
                {
                    result.push_back(p->val);
                    p = nullptr;
                }
            }
        }
        return result;
    }
};

102.二叉树的层序遍历

题目链接:. - 力扣（LeetCode）

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*>q;
        vector<vector<int>>result;
        if(root != nullptr)q.push(root);
        while(!q.empty())
        {
            int size = q.size();
            vector<int>vec;
            for(int i = 0; i < size; i ++)
            {
                TreeNode *cur = q.front();
                q.pop();
                vec.push_back(cur->val);
                if(cur-> left != nullptr) q.push(cur -> left);
                if(cur -> right != nullptr) q.push(cur -> right);
            }
            result.push_back(vec);
        }
        return result;
    }
};

107.二叉树的层次遍历II

题目链接:. - 力扣（LeetCode）

class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        queue<TreeNode*>q;
        vector<vector<int>>result;
        if(root != nullptr)q.push(root);
        while(!q.empty())
        {
            in