Looking for the shortest proof.

Problem. Lets consider a binary tree T. Every node of this tree is colored by blue or red. Every leaf of this tree is colored by red. We say that node is good if it is a leaf or node is red and...

13 July 2012 7,603 12 View