This bachelor work studies 2-3 and red-black tree data structures.
It implements these data structures and also basic operations with
them: membership, insert and delete. Formal specification of
these operations is included, so it can be used as a starting
position for verification of its implementation. This work can be
also used as an additional text to teaching declarative
programming.