Fast, type-safe Binary Search Trees (BST & RandBST). Zero-dependency data structures engineered for massive datasets and low-latency lookups.
This project simulates the Dynamic Memory Allocation process using Dictionary data structure .
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.
Add a description, image, and links to the bstrees topic page so that developers can more easily learn about it.
To associate your repository with the bstrees topic, visit your repo's landing page and select "manage topics."