The aim of project is implementing a template binary search tree (BST) in C++ language. A BST is a hierarchical data structure which allows fast lookup, addition and removal of items. In our ...

-bool insert(string, char, int) - creates and inserts a new customer (with the data shown in the parameters) in the tree, in a new tree node. -bool remove(string ...

However, in a concurrent environment, where multiple threads can access and modify the tree, a BST needs some form of synchronization to prevent data ... To implement a lock-free binary search ...