A BST and an AVL concurrent tree via logical ordering
These are two implementations (a BST and an AVL) of concurrent binary search trees via logical ordering in C programming language as they are described in the paper entitled "Practical concurrent binary search trees via logical ordering"
I developed them in my diploma thesis at NTUA.
Diploma Thesis: Parallelization techniques in concurrent data structures and algorithms, 10th semester
January 2016 - February 2016
School of Electrical and Computer Engineering
National Technical University of Athens