代码随想录训练营day15 |102

最新推荐文章于 2024-07-19 11:05:48 发布

哈572

最新推荐文章于 2024-07-19 11:05:48 发布

阅读量170

点赞数 2

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

本文链接：https://blog.csdn.net/weixin_63751870/article/details/136017731

版权

本文介绍了如何使用非递归法和递归法进行二叉树的层序遍历，以及如何通过前后序遍历实现二叉树的翻转。同时讨论了对称二叉树的递归判断方法。

摘要由CSDN通过智能技术生成

102. 二叉树的层序遍历

首先是非递归法

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

            ans.push_back(vec);

        }
        return ans;
    }
};

然后是递归法,递归又不太会写了我是笨蛋，参考卡哥代码

class Solution {
public:
    void order(TreeNode* cur, vector<vector<int>>& result, int depth)
    {
        if (cur == nullptr) return;
        if (result.size() == depth) result.push_back(vector<int>());
        result[depth].push_back(cur->val);
        order(cur->left, result, depth + 1);
        order(cur->right, result, depth + 1);
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> result;
        int depth = 0;
        order(root, result, depth);
        return result;
    }
};

226. 翻转二叉树

卡哥写的是前序，但后序也是可以的。我用的后序

class Solution {
public:
    void order(TreeNode* cur, vector<vector<int>>& result, int depth)
    {
        if (cur == nullptr) return;
        if (result.size() == depth) result.push_back(vector<int>());
        result[depth].push_back(cur->val);
        order(cur->left, result, depth + 1);
        order(cur->right, result, depth + 1);
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> result;
        int depth = 0;
        order(root, result, depth);
        return result;
    }
};

101. 对称二叉树

递归的终止条件不要写多了

class Solution {
public:
    bool issame(TreeNode* left ,TreeNode* right){
        if(left==NULL && right!=NULL) return false;
        else if(left!=NULL && right==NULL) return false;
        else if(left==NULL && right== NULL) return true;
        else if(left->val != right->val) return false;

        bool outside = issame(left->left,right->right);
        bool inside = issame(left->right,right->left);
        return outside && inside;
        
    }
    bool isSymmetric(TreeNode* root) {
        if(root == NULL) return true;
        return issame(root->left,root->right);
    }
};