In C++ 1. Implement a Binary Search Tree (BST) that stores student data for a class attendance system. This system mu
Posted: Tue Jul 12, 2022 8:04 am
In C++1. Implement a Binary Search Tree (BST) that stores student data for a class attendance system. This system must store the student ID as the key, Student Name, andThe Time of Attendance. It should also have the following menu:
a.) Insert Student Data: By choosing this option, theStudent ID and name are being inputted automatically based onthe time of the data input.
b.) Search: By choosing this option, User need to input theStudent ID to search for the student's attendance, then it showsthe student's name, ID, and time of attendance. If the studentwasn't present, it will show "Student Wasn't Present".
c.) Display All Student Data: By choosing this option, thesystem will show all the students data (ID-NAME-Time ofAttendance)
a.) Insert Student Data: By choosing this option, theStudent ID and name are being inputted automatically based onthe time of the data input.
b.) Search: By choosing this option, User need to input theStudent ID to search for the student's attendance, then it showsthe student's name, ID, and time of attendance. If the studentwasn't present, it will show "Student Wasn't Present".
c.) Display All Student Data: By choosing this option, thesystem will show all the students data (ID-NAME-Time ofAttendance)