This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n vertices. Prove that there is a vertex v whose removal produces no subtree with more than n/ 2 vertices. Design a O ( n )-time algorithm Fnd such a vertex v . 1...
View Full Document
This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.
- Spring '10