If I have a tree with n nodes (not ordered in any way) and want to remove a node V. After I have removed V I want the resulting trees to have at most n/2 nodes. How do I choose V in linear time?
