Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q’ option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student's id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P: Print the list of student records sorted by id. Here the program should print the list of student records on the screen in increasing order of the student id. The records should be printed one student record (id, name, GPA) per output line. Q: Quit

Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q’ option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student's id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P: Print the list of student records sorted by id. Here the program should print the list of student records on the screen in increasing order of the student id. The records should be printed one student record (id, name, GPA) per output line. Q: Quit

C++ Programming: From Problem Analysis to Program Design
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...
See similar textbooks
icon
Related questions
Question
Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q' option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student’s id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P: Print the list of student records sorted by id. Here the program should print the list of student records on the screen in increasing order of the student id. The records should be printed one student record (id, name, GPA) per output line. Q: Quit
Transcribed Image Text:Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q' option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student’s id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P: Print the list of student records sorted by id. Here the program should print the list of student records on the screen in increasing order of the student id. The records should be printed one student record (id, name, GPA) per output line. Q: Quit
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS