Root Equals Sum of Children

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

Return true if the value of the root is equal to the sum of the values of its two children, or false otherwise.

Example 1
        10
       /  \
      4    6
Inputroot = [10,4,6]
Outputtrue
The values of the root, its left child, and its right child are 10, 4, and 6, respectively, and 10 is equal to 4 + 6.
Example 2
        5
       / \
      3   1
Inputroot = [5,3,1]
Outputfalse
The values of the root, its left child, and its right child are 5, 3, and 1, respectively, and 5 is not equal to 3 + 1.

Constraints

  • The tree consists only of the root, its left child, and its right child.
  • -100 <= Node.val <= 100

Asked at 5 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate