Question

Tree t if we remove v, then each connected component has at most n/2 vertices

Answer 1

Answer:

Is this girl mad??

She just types,"Hey dear here is your answer"

and doesn't answer at all.