find maximum distance in set of nodes

Question

We are give a tree T, and a set of nodes initially empty P={}. we have 3 kind of operations:

1.add a node to `P`
2.delete a node from `P