day15(一刷代码随想录补卡）110 平衡二叉树| 257 二叉树的所有路径|404 左叶子之和 |222完全二叉树的节点个数

110 平衡二叉树

题目链接：https://leetcode.cn/problems/balanced-binary-tree/description/

/**
 * 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:
    //明确递归函数的参数及返回值（返回以该节点为根节点的高度，如果不是平衡二叉树则返回-1）
    int getHeight(TreeNode* node){
        //明确终止条件(遇到空节点终止，树高度为0)
        if (node == nullptr)
        return 0;
        //明确单层递归逻辑（左子树高度和右子树高度的差值）
        int leftHeight = getHeight(node->left);
        if (leftHeight == -1) return -1;
        int rightHeight = getHeight(node->right);
        if (rightHeight == -1) return -1;
        return abs(leftHeight-rightHeight) > 1? -1 : 1+max(leftHeight, rightHeight); //以当前节点为根节点的树的最大高度

    }
    bool isBalanced(TreeNode* root) {
        return getHeight(root) == -1 ? false : true;
    }
};

257 二叉树的所有路径

题目链接：https://leetcode.cn/problems/binary-tree-paths/submissions/555454610/

/**
 * 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 {
private:
    void traversal(TreeNode* cur, vector<int>& path, vector<string>& result)  //入根节点，记录每一条路径的path，和存放结果集的result
    {
        path.push_back(cur->val);   //前序遍历，先处理中间节点，先放进path中
        if(cur->left == nullptr && cur->right == nullptr){ //叶子节点
            string sPath;
            for (int i = 0; i < path.size()-1; i++){
                //将path中的路径转换成string模式
                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();
        }

    }    
public:
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> result;
        vector<int> path;
        if(root == nullptr) 
        return result;
        traversal(root,path,result);
        return result;
    }
};

404 左叶子之和

题目链接：https://leetcode.cn/problems/sum-of-left-leaves/description/

/**
 * 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) {}
 * };
 */
 //左叶子的定义：节点A的左孩子不为空，且左孩子的左右孩子都为空，那么A节点的左孩子为左叶子节点
class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        if(root == nullptr) return 0;
        if (root->left == nullptr && root->right== nullptr)
        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;
    }
};

222.完全二叉树的节点个数

题目链接：https://leetcode.cn/problems/count-complete-tree-nodes/description/

/**
 * 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 getNodesNum(TreeNode* cur){
        if (cur == nullptr)
        return 0;
        int leftNum = getNodesNum(cur->left);
        int rightNum = getNodesNum(cur->right);
        int treeNum = leftNum + rightNum + 1;
        return treeNum;
    }
    int countNodes(TreeNode* root) {
        return getNodesNum(root);
    }
};