Create an application to keep track of a list of students and their grades in a data structures course using a binary search tree. • Create a class called student that contains 2 data members: name and grade and then create a binary search tree of objects of this class. Make sure you validate the grade (A through F, and ? for in-progress grades). • Create a menu that has the following options: o Add a student -- add the student if he/she is not already in the class o Remove a student -- display “Not Found” error message if the student is not in the class. o Update the grade -- display “Not Found” error message if the student is not in the class. o Display class roster The program should use the binary tree definition. Please list all main, cpp, and hpp files. There must be a Student class, with Student.hpp and Student.cpp files. Do not use structures
Create an application to keep track of a list of students and their grades in a data structures course using a binary search tree.
• Create a class called student that contains 2 data members: name and grade and then create a binary search tree of objects of this class. Make sure you validate the grade (A through F, and ? for in-progress grades).
• Create a menu that has the following options:
o Add a student -- add the student if he/she is not already in the class
o Remove a student -- display “Not Found” error message if the student is not in the class.
o Update the grade -- display “Not Found” error message if the student is not in the class.
o Display class roster
The program should use the binary tree definition.
Please list all main, cpp, and hpp files. There must be a Student class, with Student.hpp and Student.cpp files. Do not use structures.
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 3 images
