Linked list where each node points to the next.

Tree structure optimized for prefix-based string lookup.

Rectangular arrangement of values.

Linked list where nodes point forward and backward.

Structure consisting of vertices and connecting edges.

Matrix containing mostly zero or empty values.

Linked list whose final node points back to the beginning.

Graph whose edges have directions.

Matrix containing relatively many populated values.

Last-in, first-out data structure.