Skip to content
/ BST Public

Project implementing a BST Dictionary to store 513 unique key-value pairs. Used to test efficiency of the data structure across three types of distributions: geometric, uniform, and zipf.

Notifications You must be signed in to change notification settings

ELWarnerII/BST

Repository files navigation

Binary Search Tree Dictionary ADT

**********************
*     Java Files     *
**********************

There are only two files necessary for running this program:
Node.java
BST.java

Store these files in the same folder and compile.
The main program for the project lies in the BST.java file.
To run the program, run BST.java.

**********************
*     Interface      *
**********************

The input files for this project must be formatted according to
the given standards in the project documentation. An unformatted
text file will not perform the correct tasks.

Upon running the program, you will be welcomed and prompted
for an input file. Simply type in the filepath and file you wish
to process. If you enter an invalid file name you will be prompted
again until you enter a valid file name.

You will then be prompted for an output file. Again,
simply type in the filepath and file name you wish your output to
be stored in. If the file you specify already exists, you will be
asked to confirm or deny whether that file should be overwritten.

The program will then execute the tree build, insert operations,
and remove operations. It will give you a message when your output
file has successfully been generated.

About

Project implementing a BST Dictionary to store 513 unique key-value pairs. Used to test efficiency of the data structure across three types of distributions: geometric, uniform, and zipf.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages