Data Structures list

Dynamic Arrays

A contiguous row of lockers that can grow in size when full, similar to the assigned seating in a theater.

Singly Linked List

A sequence of nodes where each node contains a value and a pointer to the next node, analogous to a scavenger hunt.

Hash Table

A system that uses a unique key and a hash function to quickly access values, similar to how a dictionary leads to word definitions.

Binary Search Tree (BST)

A tree structure that organizes sorted data, where left child nodes contain smaller values and right child nodes contain larger values.

Stack

A LIFO data structure where elements are added and removed from the top.

Queue

A FIFO data structure where elements are added to the back and removed from the front.

Priority Queue

A tree structure where the highest (or lowest) priority element is always at the root.

Deque (Double-Ended Queue)

A sequence that allows constant-time insertion and deletion at both ends.

Trie (Prefix Tree)

A specialized tree for storing strings, where paths from the root form words.

Graph (Adjacency List)

A representation of vertices and edges using a list or array, commonly used for modeling relationships.