COP 4531: Lecture 24

Learning objectives

After this class, you should be able to:

1. Given a sequence of disjoint set operation (Make-set, Union, and Find-set), show the resulting forest when using union by rank and path compression.

Reading assignment

1. CLR: Sections 21.1, 21.3.
2. None.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 21.3-1.

• Questions on next lecture's material
  1. None.