day17 第六章二叉树

最新推荐文章于 2024-07-15 12:10:21 发布

风华正茂，挥斥方遒

最新推荐文章于 2024-07-15 12:10:21 发布

阅读量59

点赞数

分类专栏： leetcode 文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/studyingforever666/article/details/127840173

版权

leetcode 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

第六章二叉树

今日内容

0110之平衡二叉树
0257之二叉树的所有路径
0404之左叶子之和

/**
* 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 isBalanced(TreeNode* root) {
        return traverse(root) == -1 ? false : true;
    }
    int traverse(TreeNode* root) {
        if (root == nullptr) return 0;
        int left = traverse(root->left);
        if (left == -1) return -1;
        int right = traverse(root->right);
        if (right == -1) return -1;
        return abs(left - right) > 1 ? -1 : max(left, right) + 1;
    }
};

/**
* 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<string> binaryTreePaths(TreeNode* root) {
        vector<string> result;
        traverse(root, string(), result);
        return result;
    }
    void traverse(TreeNode* root, string s, vector<string> &result) {
        if(root == nullptr) return;


        // 判断root是否是叶子结点
        if (root->left == nullptr && root->right == nullptr) {
            s.append(to_string(root->val));
            result.push_back(s);
            return;
        }


        s.append(to_string(root->val));
        s.append("->");


        traverse(root->left, s, result);
        traverse(root->right, s, 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:
    int sumOfLeftLeaves(TreeNode* root) {
        return traverse(root, false);
    }
    int traverse(TreeNode* root, bool lchild) {
        if (root == nullptr) return 0;
        int sum = 0;
        sum += traverse(root->left, true);
        sum += traverse(root->right, false);
        if (lchild && root->left == nullptr && root->right == nullptr) {
            sum += root->val;
        }
        return sum;
    }
};