Environment: Python 3.8
Key technique: tree node
You are given the
root of a binary tree that consists of exactly
3 nodes: the root, its left child, and its right child.
true if the value of the root is equal to the sum of the values of its two children, or
Input: root = [10,4,6]
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.
Input: root = [5,3,1]
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.
- If root.val = root.left.val + root.right.val, return True
- Else, return False
def checkTree(self, root):
if (root.val == root.left.val + root.right.val):