Red-blue Trees

In a *red-blue tree*, each vertex is either red or blue and adjacent vertices always have different colours. You are given a tree with $N$ vertices (numbered $1$ through $N$). It is not necessarily a red-blue tree, but its vertices are still coloured red and blue. You may perform the following operation any number of times (including zero): choose two adjacent vertices and swap their colours.