Algorithm Development Assignment

Set Class

• Write an implementation of the set class, with associated iterators using a binary search tree.
• Add to each node a link to the next smallest and next largest node.

Note: To make your code simpler, add a header and tail node which are not part of the binary search tree but help make the linked list part of the code simpler.

Please Zip the project file (which includes the source code and associated files) and submit in the assignment drop-box. Note: If you did not use Visual Studio, you will also need to include the executable code. Please be sure that your code contains a comment at the top that contains your name, date, assignmnet number and instructor's name. The code must be commented appropriately throughout.

Submit a screenshot of the executed program and the code of the program.