Coming Up

• Midterm (February 4th)

• Hash Tables

• k-d Trees

• Disjoint-set union-find with up-trees and path compression (does that not sound rocking?)

Previous slide

Back to first slide

View graphic version