算法训练day15|层序遍历 226.反转二叉树 101.对称二叉树

最新推荐文章于 2024-10-25 13:33:57 发布

xianzhanglaila

最新推荐文章于 2024-10-25 13:33:57 发布

阅读量129

点赞数

文章标签：算法 leetcode c++ 数据结构 Powered by 金山文档

本文链接：https://blog.csdn.net/Virgril/article/details/129286817

版权

层序遍历

递归法

/**
 * 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 order(TreeNode* root, vector<vector<int>>& result, int depth) {
        if(root == nullptr) return;
        if(result.size() == depth) result.push_back(vector<int>());
        result[depth].push_back(root->val);
        order(root->left, result, depth + 1);
        order(root->right, result, depth + 1);
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> result;
        int depth = 0;
        order(root, result, depth);
        return result;
    }
};

226.反转二叉树

思路：交换每个结点的左右孩子

递归法

/**
 * 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:
    TreeNode* invertTree(TreeNode* root) {
        if(root == nullptr) return root;
        swap(root->left,root->right);
        invertTree(root->left);
        invertTree(root->right);
        return root;
    }
};

101.对称二叉树

思路：对比左右两棵子树z

/**
 * 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:
    bool compare(TreeNode* left,TreeNode* right) {
        //递归结束条件
        if (left == nullptr && right != nullptr) return false;
        else if (right == nullptr && left != nullptr) return false;
        else if (right == nullptr && left == nullptr) return true;
        else if (right->val != left->val) return false;
        else return compare(left->left,right->right) && compare(left->right,right->left);
    }
    bool isSymmetric(TreeNode* root) {
        if(root == nullptr) return true;
        return compare(root->left,root->right);
    }
};