Structural Induction on complete quaternary trees.

question is little bit computer science related and long , but i will try to explain if there is any question.
SO basically , we have to prove a complete quaternary tree and colour its leaf node(the bottom node) with 3 colour . There exists a binary complete tree that has a pair of node with same colour.