Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g2201_2300.s2236_root_equals_sum_of_children.Solution

```
public class Solution
extends Object
```
2236 - Root Equals Sum of Children.
Easy

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:

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.

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

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean checkTree(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

checkTree

public boolean checkTree(TreeNode root)