#2236

Root Equals Sum of Children

newbie · 195 · lc easy +16 · verified · 84.9% accepted · 1,566 likes · top 96%

Description

You are given the root of a binary tree that has exactly 3 nodes: the root, its left child, and its right child.

Return true if the root's value equals the sum of its two children's values, otherwise return false.

Example 1:

Input: root = [10,4,6]

Output: true

Explanation: The values of the root, its left child, and its right child are 10, 4, and 6, respectively.

10 is equal to 4 + 6, so we return true.

Example 2:

Input: root = [5,3,1]

Output: false

Explanation: The values of the root, its left child, and its right child are 5, 3, and 1, respectively.

5 is not equal to 3 + 1, so we return false.

Code

# 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:

# 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: