Delphi offers some fairly simple containers: list, queue, hash table, but does not have trees or tries.
I present here a multi-index container which maintains a doubly linked list, with multiple (sorted) indexes into it. The indexes are implemented as AVL trees. You can create custom indexes and perform high speed efficient sorting, searching and iteration.
Unlike the STL, no knowledge of templates is required.