Show that in any tree there exists a node such that, if we remove this node and the edges adjacent to it, we will obtain trees which have at most n/2 nodes (the removed node is not counted anymore).
I've been thinking for a proof to that but couldn't come up with something. Any ideas?