代码随想录训练营第十六天|110.平衡二叉树257.二叉树所有的路径404.左叶子之和

110.平衡二叉树

思路对于一个节点，将其左右节点各传入求解其最大深度，然后比较即可；本体用的是，当发现一个子树为不平衡二叉树时直接返回-1，

递归思想：确定返回值和参数；确定终止条件；确定单层循环逻辑

class Solution {
public:
    
        int gethight(TreeNode* cur)
        {
            if(cur==nullptr) return 0;
            int lefthight = gethight(cur->left);
            if(lefthight==-1)return -1;
            int righthight = gethight(cur->right);
            if(righthight==-1)return -1;
            return abs(lefthight - righthight) > 1 ? -1 : 1 + max(righthight, lefthight);
        }
        bool isBalanced(TreeNode *root)
        {
            int p=gethight(root);
            return p==-1?false:true;

        }
};

257.二叉树所有的路径

本题采用递归策略，当节点左右孩子都是null时终止，这道题重点在于终止的处理，定义了sPath并通过遍历将path中的数转换为sPATH中的字符串，最后放入result中

class Solution {
private:
    void traversal(TreeNode *node, vector<int> &path, vector<string> &result)
    {
        path.push_back(node->val);
        if(node->left==nullptr&&node->right==nullptr)
        {
            string sPath;
            for(int i=0;i<path.size()-1;i++)
            {
                sPath += to_string(path[i]);
                sPath += "->";
            }
            sPath += to_string(path[path.size() - 1]);
            result.push_back(sPath);
            return;
        }
        if(node->left)
        {
            traversal(node->left, path, result);
            path.pop_back();
        }
        if(node->right)
        {
            traversal(node->right,path, result);
            path.pop_back();
        }
        
    }
public:
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<int> path;
        vector<string> result;
        if(root==nullptr)
            return result;
        traversal(root, path, result);
        return result;
        
    }
};

404.左叶子之和

递归

class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        if(root == nullptr)return 0;
        if(root->left == nullptr&&root->right==nullptr)
            return 0;

        int sumLeft=sumOfLeftLeaves(root->left);
        if(root->left != nullptr&&root->left->left==nullptr&&root->left->right==nullptr)
        {
            sumLeft = root->left->val;
        }
        int sumRight=sumOfLeftLeaves(root->right);

        return sumLeft + sumRight;
    }
};