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

---

一、110.平衡二叉树

题目链接

代码如下：

class Solution {
public:
    int getHeight(TreeNode* node) {
        if (node == NULL) return 0;
        int leftHeight = getHeight(node->left); // 左
        if (leftHeight == -1) return -1;
        int rightHeight = getHeight(node->right); // 右
        if (rightHeight == -1) return -1;
        int result;
        if (abs(leftHeight - rightHeight) > 1) { // 中
            result = -1;
        }
        else {
            result = 1 + max(leftHeight, rightHeight);
        }
        return result;
    }
    bool isBalanced(TreeNode* root) {
        return getHeight(root) == -1 ? false : true; //不能简单return getHeight(roo)，因为只有当-1的时候才不是平衡，0仍然为平衡
    }
};

二、257.二叉树的所有路径

题目链接

代码如下：

class Solution {
public:
    void traversal(TreeNode* cur, vector<int>& path,vector<string>& result) {
        path.push_back(cur->val); // 中
        if (cur->left == NULL && cur->right == NULL) {
            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 (cur->left) { // 左
            traversal(cur->left, path, result);
            path.pop_back(); // 这里回溯还是不太理解
        }
        if (cur->right) { // 右
            traversal(cur->right, path, result);
            path.pop_back();
        }
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> result;
        vector<int> path;
        if (root == NULL) return result;
        traversal(root, path, result);
        return result;
    }
};

三、404.左子叶之和

题目链接

代码如下：

class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        if (root == NULL) return 0;
        if (root->left == NULL && root-> right == NULL) return 0;
        int leftValue = sumOfLeftLeaves(root->left); // 左
        if (root->left && !root->left->left && !root->left->right) {
            leftValue = root->left->val;
        }
        int rightValue = sumOfLeftLeaves(root->right); // 右

        int sum = leftValue + rightValue; // 中
        return sum;
    }
};