Question: Using Exercise 21.4-2, give a simple proof that operations on a disjoint-set forest with union by rank but without path compression run in O(m lg
Using Exercise 21.4-2, give a simple proof that operations on a disjoint-set forest with union by rank but without path compression run in O(m lg n) time.
Exercise 21.4-2
Prove that every node has rank at most ⌊lg n⌋.
Step by Step Solution
3.40 Rating (162 Votes )
There are 3 Steps involved in it
Clearly each MAKESET and LINK operation takes O1 time Bec... View full answer
Get step-by-step solutions from verified subject matter experts
