[LeetCode]#2236. Root Equals Sum of Children

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.

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:

Example 2:


  1. If root.val = root.left.val + root.right.val, return True
  2. Else, return False





Interesting in any computer science.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store