Lab 13
June 7, 2023
This lab stored integers in a Binary Search Tree ( BST ), and then prints them out in order.
To Do:
For this lab you are to write a main program that asks the users for a series of integers, until the user enters -999 ( which is ignored. ) As each number is read in, it is added to a Binary Search Tree, either by adding another node to the tree if this is a unique integer, or incrementing a counter if this is a duplicate. After all numbers are read in, the BST is printed, in order.
Follow the instructions in the comments of the provided starting files, and submit your results to Gradescope, either via upload or via github. ( Don't forget to rename lab13.cpp to something including your netid. )