C++ program that will build BST in MSVC2017

/in /by

Programming Problem 5 on page 491 of the book (screenshot below) :

  • Just names (format: fname lname) and birthdays (format: yyyy-mm-dd) as data attributes are sufficient.
  • Implement your BST as a link-based ADT by deriving BST Node from your Node classes from Labs 2 and 2b. Remember the BST Node will contain two data attributes – name and birthday.
  • For the data, create a text file of data named ‘InputData.txt’ as follows – name or birthday entry per line, one pair of name and birthday in two consecutive lines.
  • Read the data to create your BST for the database by name or birthday as needed – remember two different trees will be needed and the node insertions will be different depending on which data tree it is.
  • Write out the listing of everyone by name to a file called ‘NamesOutput.txt’ using both pre-order and post-order traversal mechanisms in that sequence. Ensure that the output file contains names and birthdays on a single line separated by tabs. Make sure that each section is clearly identified by a header.
  • Write out the listing of everyone by birthday to a different file called ‘BirthdaysOutput.txt’ using an in-order and breadth-first traversal mechanisms in that sequence. Ensure that the output file contains names and birthdays on a single line separated by tabs. Make sure that each section is clearly identified by a header.
  • Include your code source tree, input text file and the two output files in your zip upload. Only one file upload is allowed.
  • Ensure I can run the programs by using my own input file without having to fix your code for file locations.

Any other questions or clarifications – ask on the forum first.

 
Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount!
Use Discount Code "Newclient" for a 15% Discount!

NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.