Hello, dear friend, you can consult us at any time if you have any questions, add WeChat:THEend8_
Programming Assignment 3
This programming assignment will focus on two different ways to
implement the dictionary ADT. The first one uses binary search trees
and the second one uses hash tables. You will implement the basic
dictionary operations (i.e. insert, delete and find) and study the
performance of these operations via empirical means. By completing
this assignment, you will be able to describe, compare and contrast the
implementations of these operations by binary search trees versus hash
tables.
Submission guideline
Put all of your Java source files and your written report (in pdf format)
in a single directory. Then zip them together into a single zip
file. If you submit your hardcopy late, a 25% penalty on your
project grade will be imposed.
This programming assignment is an individual project. You cannot
collaborate with any other student(s). If you use any resource(s) that
are not provided by the instructor, it is your responsibility to state
them in your report. Failure to do will be considered as a violation of
academic integrity and will be reported.
Part 1. Binary search trees
1. Select either BTNode or IntBTNode class as the basis, implement
the dictionary operations insert, delete and find as member
functions. As explained in class, IntBTNode class is a simplified
version and is recommended.
2. Design test cases to verify each of these dictionary operations.