代码随想录Day17——110.平衡二叉树 257. 二叉树的所有路径 404.左叶子之和

递归递归递归

110.平衡二叉树

给定一个二叉树，判断它是否是高度平衡的二叉树。

本题中，一棵高度平衡二叉树定义为：一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 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:
    int getHigh(TreeNode* T)
    {
        if(T == NULL) return 0;
        return 1+max(getHigh(T->left),getHigh(T->right));
    }
    bool subBalanced(TreeNode* T1,TreeNode* T2)
    {
        bool b1 = true,b2 = true;
        if(abs(getHigh(T1) - getHigh(T2)) > 1)return false;
        if(T1 != NULL) b1 = subBalanced(T1->left,T1->right);
        if(b1 == false) return false;
        if(T2 != NULL) b2 = subBalanced(T2->left,T2->right);
        if(b2 == false) return false;
        return true;
    }
    bool isBalanced(TreeNode* root) {
        if(root == NULL) return true;
        return subBalanced(root->left,root->right);
    }
};
//错误思路：最大深度和最小深度差小于1，反例[1,null,2,null,3]
/*class Solution {
public:
    int getMaxHigh(TreeNode* T)
    {
        if(T == NULL) return 0;
        return 1+max(getMaxHigh(T->left),getMaxHigh(T->right));
    }
    int getMinHigh(TreeNode* T)
    {
        if(T == NULL) return 0;
        if(T->left == NULL && T->right != NULL) return 1+getMinHigh(T->right);
        if(T->left != NULL && T->right == NULL) return 1+getMinHigh(T->left);
        return 1+min(getMinHigh(T->right),getMinHigh(T->left));
    }
    bool isBalanced(TreeNode* root) {
        if(getMaxHigh(root)-getMinHigh(root)>1) return false;
        return true;
    }
};*/

257. 二叉树的所有路径

给你一个二叉树的根节点 root ，按 任意顺序 ，返回所有从根节点到叶子节点的路径。

/**
 * 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 subTreepaths(TreeNode* T,string s,vector<string>& v)
    {
        if(T == NULL) return;
        s = s + to_string(T->val) + "->";
        if(T->left == NULL && T->right == NULL)
        {
            s.erase(s.size()-2,2);
            v.push_back(s);
            return;
        }
        subTreepaths(T->left,s,v);
        subTreepaths(T->right,s,v);
        return;
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        string s;
        vector<string> result;
        subTreepaths(root,s,result);
        return result;
    }
};

404.左叶子之和

给定二叉树的根节点 root ，返回所有左叶子之和。

/**
 * 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 subSum(TreeNode* T,int& sum)
    {
        if(T == NULL) return;
        if(T->left != NULL && T->left->left == NULL && T->left->right == NULL) sum += T->left->val;
        subSum(T->left,sum);
        subSum(T->right,sum);
    }
    int sumOfLeftLeaves(TreeNode* root) {
        int sum = 0;
        subSum(root,sum);
        return sum;
    }
};