Based on an assignment that creates a Binary Search Tree based on the AVL method where 3 threads add, delete and balance the tree respectively. Completed 27/02/2017
License: GNU General Public License v3.0
Makefile 1.08%C 98.92%
avl-bst-pthreads's Introduction
Assignment to use pthreads that adds to, deletes from and balances a Binary Search Tree continuously
Note: This was developed early in the course and may be a bit rough around the edges
e.g. It has not been properly seperated into header files etc
To compile:
make
To test serial:
make stest
To test pthreads:
make ptest
To configure:
./serial.out [-nqs]
./pthread.out [-nqs]
-n [int] to set number of loops
-q to suppress output
-s [int] to set a certain seed