Student Management Data Structures

The Student Management Data Structures project is designed to provide an efficient way of storing and managing student records using four different data structures. The project is built using the C++ programming language and includes an intuitive user interface that allows users to add, remove, search for, and print student records sorted by ID or GPA.

The four data structures used in this project are AVL tree, Binary Search Tree (BST), Min Heap, and Max Heap. Each data structure is optimized for different types of operations, such as inserting, deleting, and searching records, as well as sorting them by ID or GPA. By offering these different data structures, users can compare their performance and choose the one that best fits their needs.

Features

• Efficient storage and retrieval of student records using four different data structures.
• User-friendly interface with intuitive menus for each data structure.
• Ability to add, remove, search for, and print student records.
• Sorting of student records by [ID]or GPA depending on the data structure.
• Ability to switch between data structures at runtime to compare performance.

Usage

The program is designed to manage a list of student records using four different data structures: AVL tree, Binary Search Tree Min Heap and Max Heap. Each data structure provides the following features:

AVL Tree and Binary Search Tree (BST)

• Add a student record
• Remove a student record
• Search for a student record
• Print all student records sorted by ID

Min Heap and Max Heap

• Add a student record
• Print all student records sorted by GPA

To use the program:

1. Run the program and choose a data structure to use.
2. The program will read the student records from the input file and insert them into the chosen data structure.
3. Follow the on-screen instructions to add, remove, search for, or print student records.
4. To switch to a different data structure, exit the current menu and choose a new data structure from the main menu.