Fast, type-safe Binary Search Trees (BST & RandBST). Zero-dependency data structures engineered for massive datasets and low-latency lookups.

A program for dynamic allocation of memory. The memory may be allocated, freed and defragmented by merging discrete blocks together to take up less space. Linked Lists, Binary Search Trees and AVL Trees have been used to mimic memory.

This project simulates the Dynamic Memory Allocation process using Dictionary data structure .