【LeetCode-03 判断根结点是否等于子结点之和 python解法】

代码：

# 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 checkTree(self, root: Optional[TreeNode]) -> bool:
        if root.left.val + root.right.val == root.val :
            return True
        else :
            return False

注：若判断是否为叶子节点，可用 if (root.left == root.right) { // 递归边界：判断 root 是否为叶子节 return true; } 若为叶子节点：root.left = None root.right = None