D17 平衡二叉树 二叉树的所有路径 左叶子之和

平衡二叉树：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isBalanced(self, root: Optional[TreeNode]) -> bool:
        if self.get_height(root) != -1:
            return True
        else:
            return False

    def get_height(self, root: TreeNode) -> int:
        if not root:
            return 0
        if (left_height := self.get_height(root.left)) == -1:
            return -1
        if (right_height := self.get_height(root.right)) == -1:
            return -1
        if abs(left_height - right_height) > 1:
            return -1
        else:
            return 1 + max(left_height, right_height)
        

 主要是处理两种情况：一个是如果左右子树高度差大于1，就直接返回-1， 然后一路往上返回-1。

如果不是这种情况，就正常记录每个节点的高度。

左叶子之和：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def sumOfLeftLeaves(self, root: Optional[TreeNode]) -> int:
        if not root:
            return 0
        
        left_left_leaves_sum = self.sumOfLeftLeaves(root.left)
        right_left_leaves_sum = self.sumOfLeftLeaves(root.right)

        cur_left_leaf_val = 0
        if root.left and not root.left.left and not root.left.right:
            cur_left_leaf_val = root.left.val
        return cur_left_leaf_val + left_left_leaves_sum + right_left_leaves_sum

cur_left_leaf_val是累加的起点，不加这个return的一直是0

class Solution:
    def sumOfLeftLeaves(self, root: Optional[TreeNode]) -> int:
        if not root:
            return 0
        
        left_left_leaves_sum = 0
        if root.left and not root.left.left and not root.left.right:
            left_left_leaves_sum = root.left.val
        else:
            left_left_leaves_sum = self.sumOfLeftLeaves(root.left)
        
        right_left_leaves_sum = self.sumOfLeftLeaves(root.right)

        return left_left_leaves_sum + right_left_leaves_sum

这版代码集成度更好