Exploring Data Structures

Understand the fundamental building blocks of efficient computation.

Arrays

A collection of elements of the same type, stored in contiguous memory locations, accessed by an index.

Linear, Static/Dynamic

Linked Lists

A sequential collection of data elements where each element points to the next element in the sequence.

Linear, Dynamic

Stacks

A linear data structure that follows the Last-In, First-Out (LIFO) principle.

Linear, Abstract

Queues

A linear data structure that follows the First-In, First-Out (FIFO) principle.

Linear, Abstract

Trees

A hierarchical data structure consisting of nodes connected by edges, with a single root node.

Non-linear, Hierarchical

Graphs

A non-linear data structure consisting of nodes (vertices) and edges connecting them.

Non-linear, Network

Hash Tables

A data structure that implements an associative array, mapping keys to values using a hash function.

Associative, Key-Value