Back to Portfolio

Balanced Binary Search Tree Comparison

• Class:CSCI 315 Data Structures
• Grade: 100%
• Language(s):C++
• Source Code Repository: Balanced Binary Search Tree Comparison
  (Please email me to request access.)

Project description

This project compares the implementation of balancing a binary search tree. The two methods compared are AVL and Splay. The comparisons are for the actions of inserting, deleting, searching and searching the same element. The outcome of the comparison can be seen through the plot graphs.

How to compiles / run the program

Program runs in command line. In order to gather performance data the funciton to be analyzed needs to be inputed on line 12 of main.cpp. Given makefile with source code the run routine is as follows:

make
./main > data.txt

After data files have been collected for each function desired run performance plot.

UI Design

Command line program.
Performance graphs for comparison between different functions using AVL and Splay methods.

3. Additional Considerations

Performance may vary depending on hardware.

For more details see Balanced Binary Search Tree Comparison.

Back to Portfolio