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

最新推荐文章于 2024-07-10 21:37:49 发布

老废物h

最新推荐文章于 2024-07-10 21:37:49 发布

阅读量77

点赞数 2

文章标签： java

本文链接：https://blog.csdn.net/weixin_47247047/article/details/139548574

版权

110.平衡二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isBalanced(TreeNode root) {
        return getHeight(root) != -1;

    }
    private int getHeight(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftHeight = getHeight(root.left);
        if (leftHeight == -1) {
            return -1;
        }
        int rightHeight = getHeight(root.right);
        if (rightHeight == -1) {
            return -1;
        }
        // 左右子树高度差大于1，return -1表示已经不是平衡树了
        if (Math.abs(leftHeight - rightHeight) > 1) {
            return -1;
        }
        return Math.max(leftHeight, rightHeight) + 1;
    }
}

这里自己有不明白的地方，如果是-1和0 的话为什么依然成立

左叶子之和

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int res=0;
    public int sumOfLeftLeaves(TreeNode root) {
        
        digui(root,0);
        return res;

    }
    void digui(TreeNode root,int biaoji){
        if (root==null) {
            return;
            
        }
        
        if (root.left==null&&root.right==null&&biaoji==1) {
            res+=root.val;
            
        }
        digui(root.left, 1);
        digui(root.right, 2);

    }
}

自己的思想就是先序，然后增加一个标记，是左叶子的进行判断