Suppose we want to add an extra operation, remove(x), which removes x from itscurrent
Chapter 8, Problem 8.11(choose chapter or problem)
Suppose we want to add an extra operation, remove(x), which removes x from itscurrent set and places it in its own. Show how to modify the union/find algorithmso that the running time of a sequence of M union, find, and remove operations isO(M(M,N)).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer