ADT Design

Every data structure is some combination of the following core data structures:

• primitives
• structures
• arrays
• linked lists
• trees
• graphs

Implementing collection ADTs

• Stack ⇒ Linked lists or dynamic arrays
• Queue ⇒ Linked lists
• Sequence ⇒ Linked lists or dynamic arrays
• Dictionary (and Sets) ⇒ Self-balanced BSTs or hash tables

Generic ADT Implementations

Void pointers

<aside> 💡 A void pointer is a pointer that does not have any associated type information. This means that it can point to any type of data.

</aside>

Generic quick sort