代码随想录训练营day 13【补】| Leetcode

最新推荐文章于 2024-09-14 18:52:56 发布

雷达的吉兹拉斯

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量116

点赞数 2

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_47533957/article/details/141173943

版权

Leetcode 144 二叉树的前序遍历

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

Leetcode 145 后序遍历

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

Leetcode 94 中序遍历

class Solution {
public:
    void travesal(TreeNode* cur, vector<int> &vec){
        if(cur == NULL) return;
        travesal(cur->left, vec);
        vec.push_back(cur->val);
        travesal(cur->right, vec);
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;
        travesal(root, result);
        return result;
    }
};

Leetcode 102 层序遍历

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