# 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:
return root.val == root.right.val + root.left.val
2236.Root Equals Sum of Children
最新推荐文章于 2024-07-20 09:51:47 发布