a binary search tree (BST)
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.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
