Data Structures

Dynamic array with random access and operations

Linear collection with node-based storage

LIFO data structure for push/pop operations

FIFO data structure for enqueue/dequeue operations

Queue with circular buffer implementation

Queue allowing operations at both ends

Tree structure for efficient searching and sorting

Self-balancing binary search tree

Complete binary tree with heap property

Key-value storage with hash-based lookup

Prefix tree for string storage and retrieval

Network of vertices connected by edges