kevingalacha / binary_search_trees

In this second year Computer Science assignment, in the Data Structures module, our task was to compare the time complexity of the Binary Search Tree and AVL Tree search algorithms. The results are detailed in the 'report.pdf ' document.

binary_search_trees

The purpose of this assignment was to compare the time complexity of the search algorithm in Binary Search Tree and AVL Tree data structures. The AVL Trees balancing property makes it's search algorithm more efficient on average.

Graphs comparing the time complexity of both algorithms:

The 'Report.pdf' details all results of the assignment.

To test the search functions in the terminal, clone the repository and type the following commands:

To search the Binary Search Tree:

To Search the AVL Tree:

You may pick a different dam name to search from the data, some options are:

Johan Neser Dam Klerkskraal Dam Elandskuil Dam Rietspruit Dam Spitskop Dam Taung Dam