代码随想录训练营第十七天

求高度，要用后序遍历，求深度，要用前序遍历

平衡二叉树

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

对代码和思路理解了

二叉树的所有路径

这题不会，不太看得懂

class Solution {
public:
    void traversal(TreeNode* root, vector<int>& path, vector<string>& result) {
        path.push_back(root->val);
        if(root->left == nullptr and root->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(root->left) {
            traversal(root->left, path, result);
            path.pop_back();
        }
        if(root->right) {
            traversal(root->right, path, result);
            path.pop_back();
        }
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> result;
        vector<int> path;
        if(root == nullptr) return result;
        traversal(root, path, result);
        return result;
    }
};

左叶子之和

这题理解思路后能看懂

class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        if(root == nullptr) return 0;
        if(root->left == nullptr and root->right == nullptr) return 0;
        int leftValue = sumOfLeftLeaves(root->left);
        if(root->left and !root->left->left and !root->left->right) {
            leftValue = root->left->val;
        }
        int rightValue = sumOfLeftLeaves(root->right);
        int sum = leftValue + rightValue;
        return sum;
    }
};