This is a semester project for Non-procedural Programming (NPRG005) course.
The goal was to implement a red-black tree and compare its performance to an ordinary unbalanced tree.
graphs-and-data folder contains graphs representing performance of both red-black tree and binary search tree, as well as data used to plot these graphs.
The original date of submission is: 22.06.2020