by java :$.$ Write a program to create a Singly Linked List of employees where each studentnode

contains

thefollowing attributes:

Student$\_$Id

Student$\_$Name

Student$\_$GPA

Create following methods for implementation of the list created:

$$ AddFirst$()$ to insert a student at the start of the list.

$$ DeleteFirst$()$ to delete a student from the start of the list.

$$ AddLast$()$ to insert a student at the start of the list.

$$ DeleteLast$()$ to delete a student from the start of the list.

$$ Display$()$ to display the details of all the Students in the list.

$2.$ Define doubly linked list? Write a program to create a doubly linked list containing $5$ nodes

with the values$(20,43,68,79,81).$

$$ Insert node in front of doubly linked list and display the list.

$$ Delete the last element of doubly linked list.

$$ Again insert a new node in front of doubly linked list and display the list.

$3.($a$)$ What are the various applications of Binary Search trees? Apply the

following operations on the binary search tree given below. Write all the basic

steps needed.

$$ Inorder Traversal

$$ Preorder Traversal

$$ Post order Traversal

$$ Insert elements $21$ and $34$

$$ Delete element $36.$

$4.$ Draw the binary min$-$heap after inserting the following values, one after another.

$21,13,12,25,4,20,16,1,11.$

You must show that insertion step by step. Delete a root node from the heap using down

heap Bubbling.

$5.$ The following diagram shows a binary search tree. Perform the following operations:

insert $24,$ insert $19,$ and delete $50.$ Use the inorder successor to perform node deletion.

Draw the new BST after every operation.Draw the binary min$-$heap after inserting the following values, one after another.

$21,13,12,25,4,20,16,1,11.$

You must show that insertion step by step. Delete a root node from the heap using dow

heap Bubbling.

The following diagram shows a binary search tree. Perform the following operations:

insert $24,$ insert $19,$ and delete $50.$ Use the inorder successor to perform node deletion

Draw the new BST after every operation.