Data structures and abstract data types

Ordered collections of elements of the same data type stored in contiguous memory locations, accessed by integer indices

Fundamentals of data structures

Data structures and abstract data types

Data structures grouping multiple named fields of potentially different types, representing composite data entities. Rec

Fundamentals of data structures

Data structures and abstract data types

Last-In-First-Out (LIFO) data structures where elements are added and removed from the same end (top). Stacks naturally

Fundamentals of data structures

Data structures and abstract data types

First-In-First-Out (FIFO) data structures where elements are added at one end (rear) and removed from the other (front).

Fundamentals of data structures

Data structures and abstract data types

Sequential data structures where elements (nodes) contain data and references (pointers/links) to next nodes. Linked lis

Fundamentals of data structures

Data structures and abstract data types

Hierarchical data structures with a root node and child nodes, where each node has at most one parent. Trees organize da

Fundamentals of data structures

Data structures and abstract data types

Trees where each node has at most two children, typically called left and right children. Binary trees enable efficient

Fundamentals of data structures

Data structures and abstract data types

Data structures using hash functions to map keys to storage indices, enabling O(1) average-case lookup time. Hash tables

Fundamentals of data structures

Data structures and abstract data types

Data structures with nodes (vertices) and edges connecting pairs of nodes, enabling representation of arbitrary relation

Fundamentals of data structures

Data structures and abstract data types

Dynamic arrays that automatically resize when capacity is exceeded, providing both array-like indexed access and automat

Fundamentals of data structures

Data structures and abstract data types

A queue implementation where the end wraps around to the beginning, reusing storage space. Circular queues avoid wasting

Fundamentals of data structures

Data structures and abstract data types

A queue where elements are ordered by priority, with highest priority elements dequeued first. Priority queues enable sc

Fundamentals of data structures

Data structures and abstract data types

A 2D array representation of graphs where rows and columns represent vertices and matrix values represent edges. Element

Fundamentals of data structures

Data structures and abstract data types

A linked list representation of graphs where each vertex maintains a list of adjacent vertices. Adjacency lists are spac

Fundamentals of data structures

Data structures and abstract data types

Graphs where edges carry weights (costs, distances, capacities) representing relationship quantities. Weighted graphs mo

Fundamentals of data structures

Data structures and abstract data types

Trees where heights of subtrees differ by at most a constant factor, maintaining O(log n) operations. Balancing ensures

Fundamentals of data structures

Data structures and abstract data types

Self-balancing binary search trees where subtree heights differ by at most 1. AVL trees guarantee O(log n) operations th

Fundamentals of data structures