ConceptTheory & Algos
Fusion trees
A static integer data structure that achieves time for predecessor and successor queries using word-level parallelism.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Word RAM model2Binary tree1Bitwise operations1Hashing1Integer data structures1Predecessor problem1Search problem1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Erik Demaine
Connections
7The lectures that define it or assume it, and the concepts next to it.