代码随想录算法训练营 | Day17 lc110平衡二叉树 lc257二叉树的所有路径lc404左叶子之和

最新推荐文章于 2024-08-12 22:15:13 发布

Mr_Click

最新推荐文章于 2024-08-12 22:15:13 发布

阅读量227

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/Mr_Click/article/details/136950538

版权

lc110 平衡二叉树

求高度：用后序遍历
求深度：用前序遍历

文章&视频：
lc110

代码：

/**
 * 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 getHeight(TreeNode* node) {
        if (node==NULL) return 0;       // 空节点高度为0
        int leftHeight = getHeight(node->left);
        if (leftHeight==-1) return -1;
        int rightHeight = getHeight(node->right);
        if (rightHeight==-1) return -1;

        int height = 0;
        if (abs(leftHeight-rightHeight)>1) height = -1;
        else {
            height = max(leftHeight, rightHeight) + 1;
        }
        return height;
    }

    bool isBalanced(TreeNode* root) {
        // bool flag = true;
        // int height = getHeight(root);
        // if (height==-1) flag = false;
        // return flag;
        return getHeight(root) == -1 ? false : true;
    }
};

lc257二叉树的所有路径

文章&视频: lc257

代码：

/**
 * 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 traversal(TreeNode* node, vector<int> &path, vector<string> &result) {
        path.push_back(node->val);
        if (node->left==NULL &&node->right==NULL) {
            // result.push_back(path);
            string sPath;
            for (int i = 0; i < path.size(); i++) {
                sPath += to_string(path[i]);
                sPath += "->";
            }
            sPath = sPath.substr(0, sPath.size()-2);
            result.push_back(sPath);              

        }
        if (node->left) {
            traversal(node->left, path, result);
            path.pop_back();                         // 回溯
        }
        if (node->right) {
            traversal(node->right, path, result);
            path.pop_back();
        }
    }

    vector<string> binaryTreePaths(TreeNode* root) {
        vector<int> path;
        vector<string> result;
        traversal(root, path, result);
        return result;
    }
};

lc404左叶子之和

文章&视频：lc404

代码：

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