Java Code ~ Java Code ~ Java Code

Main Question to code:

Figure 2.16:

Exercise 30: A database is to be developed to keep track of student information at your college. Their names, identification numbers, and grade point averages will be included. The data set will be accessed in the key field mode, with the student's name being the key field. Code a class named Listing that defines the nodes. The class must comply with the guidelines that permit student information nodes to be stored in the fully encapsulated BinaryTree structure. As such, your class should include all the methods in the class shown in Figure 2.16 and include a getKey method. Test it with a progressively developed driver program that demonstrates the functionality of all of its methods. When launched, the user will be presented with the following menu:

Enter:

1 to insert a new student's information,

2 to fetch and output a student's information,

3 to delete a student's information,

4 to update a student's information,

5 to output all the student information in descending order, and

6 to exit the program.

Java Code ~ Java Code ~ Java Code PS: Would appreciate if there would be comments telling the hows and whys.

34. Code the generic version of the linked-based Binary Search Tree using the generic features of Java 5.0, and provide a driver program to demonstrate that the method functions properly. The driver program should declare two binary search tree objects: one to store Listing objects as defined in Figure 2.16 with a getKey method added to the class, and the other to store Student objects as described in Exercise 30