Java Reference
In-Depth Information
tree after the UNION operation. For example, consider processing the
equivalence (A, B) where A 0 is the root of A and B 0 is the root of B.
Assume the tree with root A 0 is bigger than the tree with root B 0 . At the
end of the UNION/FIND operation, nodes A, B, and B 0 will all point
directly to A 0 .
Search WWH ::




Custom Search