Given a binary tree, check if the tree satisfies
the property that for each node, the sum of the values of its left and
right children are equal to the node's value. If a node has only
one child, then the node should have the same value as that
child. Leaf nodes automatically satisfy the property.
Make sure that you are comparing the value of a node against the sum of its immediate children, NOT the sum of all its descendents.