The sequence F0, F1, … of Fibonacci trees is recursively defined as follows:
How can I prove that each Fi (i >= 0) after adding NIL nodes can be colored red an