Implement union-find with path compression + rank, describe k-D trees and treaps.
This lesson requires an active subscription.