Compression of binary search trees

We store a structure only if it is unique, if it's not, we allow a vector containing roots & pointing to the appropriate structure, see the document ouv_projet.pdf

By Amine Benslimane && Sofiane Braneci

Master 1 STL - Sorbonne Université,
Jan 2021

example of a BST compression

Experimentation results

In terms of research time :

In terms of memory used :

Licence

GPL v3, feel free to use this code