{"id":18822894,"url":"https://github.com/salma-mamdoh/student-management-data-structures","last_synced_at":"2025-09-05T02:41:35.153Z","repository":{"id":178201432,"uuid":"637175601","full_name":"Salma-Mamdoh/Student-Management-Data-Structures","owner":"Salma-Mamdoh","description":"Our project for Data Structures Course taken during fall 2023 semester","archived":false,"fork":false,"pushed_at":"2023-07-03T00:38:54.000Z","size":28,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-29T11:56:04.426Z","etag":null,"topics":["avl-tree","binary-search-tree","cpp","filesystem","heap-tree","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Salma-Mamdoh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-06T18:35:25.000Z","updated_at":"2024-05-07T15:43:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"5dc5179c-a325-40b0-9e95-74330925e1c8","html_url":"https://github.com/Salma-Mamdoh/Student-Management-Data-Structures","commit_stats":null,"previous_names":["salma-mamdoh/student-management-data-structures"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Salma-Mamdoh/Student-Management-Data-Structures","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Salma-Mamdoh%2FStudent-Management-Data-Structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Salma-Mamdoh%2FStudent-Management-Data-Structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Salma-Mamdoh%2FStudent-Management-Data-Structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Salma-Mamdoh%2FStudent-Management-Data-Structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Salma-Mamdoh","download_url":"https://codeload.github.com/Salma-Mamdoh/Student-Management-Data-Structures/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Salma-Mamdoh%2FStudent-Management-Data-Structures/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273703374,"owners_count":25152999,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-05T02:00:09.113Z","response_time":402,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["avl-tree","binary-search-tree","cpp","filesystem","heap-tree","tree-structure"],"created_at":"2024-11-08T00:52:01.613Z","updated_at":"2025-09-05T02:41:30.137Z","avatar_url":"https://github.com/Salma-Mamdoh.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003c!DOCTYPE html\u003e \u003chtml lang=\"en\"\u003e \u003chead\u003e \u003cmeta charset=\"UTF-8\"\u003e \n# Student Management Data Structures\n\u003c/head\u003e \u003cbody\u003e\u003cp\u003eThe 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.\n\nThe 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.\u003c/p\u003e\n\u003c/body\u003e\n\u003ch2\u003eFeatures\u003c/h2\u003e\n\u003cul\u003e\n\t\u003cli\u003eEfficient storage and retrieval of student records using four different data structures.\u003c/li\u003e\n\t\u003cli\u003eUser-friendly interface with intuitive menus for each data structure.\u003c/li\u003e\n\t\u003cli\u003eAbility to add, remove, search for, and print student records.\u003c/li\u003e\n\t\u003cli\u003eSorting of student records by [ID]or GPA depending on the data structure.\u003c/li\u003e\n\t\u003cli\u003eAbility to switch between data structures at runtime to compare performance.\u003c/li\u003e\n\u003c/ul\u003e\n\n\n\u003ch2\u003eUsage\u003c/h2\u003e\n\u003cp\u003eThe 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:\u003c/p\u003e\n\n\u003ch3\u003eAVL Tree and Binary Search Tree (BST)\u003c/h3\u003e\n\u003cul\u003e\n\t\u003cli\u003eAdd a student record\u003c/li\u003e\n\t\u003cli\u003eRemove a student record\u003c/li\u003e\n\t\u003cli\u003eSearch for a student record\u003c/li\u003e\n\t\u003cli\u003ePrint all student records sorted by ID\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eMin Heap and Max Heap\u003c/h3\u003e\n\u003cul\u003e\n\t\u003cli\u003eAdd a student record\u003c/li\u003e\n\t\u003cli\u003ePrint all student records sorted by GPA\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003cp\u003eTo use the program:\u003c/p\u003e\n\u003col\u003e\n\t\u003cli\u003eRun the program and choose a data structure to use.\u003c/li\u003e\n\t\u003cli\u003eThe program will read the student records from the input file and insert them into the chosen data structure.\u003c/li\u003e\n\t\u003cli\u003eFollow the on-screen instructions to add, remove, search for, or print student records.\u003c/li\u003e\n\t\u003cli\u003eTo switch to a different data structure, exit the current menu and choose a new data structure from the main menu.\u003c/li\u003e\n\u003c/ol\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsalma-mamdoh%2Fstudent-management-data-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsalma-mamdoh%2Fstudent-management-data-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsalma-mamdoh%2Fstudent-management-data-structures/lists"}