V knige privoditsya vsestoronniy analiz idey i detaley realizatsii struktur dannyh kak vazhneyshey sostavlyayuschey prikladnyh algoritmov. Obsuzhdayutsya ne tolko effektivnye sposoby realizatsii operatsiy nad mnozhestvami chisel, intervalov ili strok, predstavlennyh v vide razlichnyh poiskovyh struktur dannyh - derevev, mnozhestv intervalov, kusochno-postoyannyh funktsiy, pryamougolnyh oblastey, neperesekayuschihsya podmnozhestv, kuch, hesh-tablits, no i dinamizatsiya i persistentnost (sohranyaemost) struktur. Struktury dannyh vpervye rassmatrivayutsya ne prosto kak vspomogatelnyy material dlya illyustratsii metodologii obektno orientirovannogo programmirovaniya, a kak klyuchevoy vopros razrabotki algoritmov. Mnogochislennye primery koda na yazyke C i bolee 500 ssylok na pervoistochniki delayut knigu isklyuchitelno tsennoy.