CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is - Disjoint-set data structure - Document - PDFSEARCH.IO

First Page	Meta Content
	CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is Add to Reading List Document Date: 2006-02-27 14:13:36 Open Document File Size: 123,14 KB Share Result on Facebook Company MIT Press / McGraw-Hill / / IndustryTerm search node / / Organization Douglas R. Lanman Union / MIT / / Person Charles E. Leiserson / Ronald L. Rivest / Thomas H. Cormen / Clifford Stein / Claire Kenyon / Jeff Erickson / / Product Shafrir / / URL http / SocialTag Computing Data structures B-tree Disjoint-set data structure Rope Linked list R-tree Ternary tree Fibonacci heap Binary trees

CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, isAdd to Reading List