Thoughts Good thought Traverse the tree, set the result as the larger one between itself and sum of left and right child trees Every node return max of left and right and then plus 1