abstract data type - sellout/data-structure-zoo GitHub Wiki
An abstract data type (or ADT) is a common interface to many different data structure implementations. For example, a set is an ADT that can be implemented with various data structures, such as a trie or a hash table. Each ADT provides operations that can be performed on instances, and different implementations might have different performance characteristics for various operations.
On the page for each ADT, there is an attempt to order the implementations roughly by performance characteristic, with the idea that in long lists, the ones toward the end will not be interesting to an implementer (although they may be more straightforward).
NOTE: The hierarchy below is rough. Once we have dot support, we can show the actual directed acyclic graph of relationships.