Write the details algorithm and convert into java code for the solution of Binary search Tree 1- Construct a binary search tree to keep the records of the student’s names. You can insert the name of students that should follow the rules of binary search tree until press character ‘N’. 2- Perform the search operation to find the particular student. 3- Delete any one leaf node student 4- Delete any one student with one child node 5- Delete any one student with two child nodes. 6- Perform the pre-order traversal 7- Perform the in-order traversal 8- Perform the post-order traversal.

Strategies (used): • Binary search tree technique.

Answer rating: 100% (QA)

Java implementation of a Binary Search Tree BST to keep records of student names along with the requested operations java import javautilScanner class StudentNode String name StudentNode left right pu... View the full answer