Suppose we want to add an extra operation, deunion, which undoes the last unionoperation
Chapter 8, Problem 8.10(choose chapter or problem)
Suppose we want to add an extra operation, deunion, which undoes the last unionoperation that has not been already undone.a. Show that if we do union-by-height and finds without path compression, thendeunion is easy and a sequence of M union, find, and deunion operations takesO(M logN) time.b. Why does path compression make deunion hard? c. Show how to implement all three operations so that the sequence of Moperations takes O(M logN/log logN) time.
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