[Leetcode] 2236. Root Equals Sum of Children

 

# 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.left.val + root.right.val)

https://leetcode.com/problems/root-equals-sum-of-children/

LeetCode - The World's Leading Online Programming Learning Platform