Argument, continued: “Pennies”)
Time for FIND(x) is proportional to:
The number of nodes long the path from x to its root r.
To find the total time for all the FIND operations in a sequences of UNIONs and FINDs, we’ll “pay a penny for each node visited.”
There will be two kinds of pennies: American and Canadian.