Dynamic hashing Organize overflow buckets as binary trees m binary trees for m primary pages produces index of primary page Particular access structure for binary trees Family of functions Each produces a bit At level , , take left branch, otherwise right branch Example: bit representation