COSC $2007$: Data Structure II

Assignment#$2$

Write the details algorithm and convert into java code for the solution of Binary search Tree

Constnuct a binaty 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 starch tree until press character $\text{'}N\text{'}.$

$2-$ Perforn the search operation to find the particular student.

Delete any one leaf node student

$4-$ Delete any one student with one child node

Delete any one student with two child noxles.

Perfom the pre$-$order traversal

$7-$ Perfom the in$-$order traversal

Perfom the poot$-$order traversal

Strategies to be used:

Bibaty searchi tree techaque

Methods.Functions: You can define any number of methods as you like.

Output: You should display the ourput for all tasks $1-8$

What to submit: The subuission is Assigmeur?

How to submit an Assigument. You can prepare a document enther text file or puf file. Course tame. Student name, and snident number should the written st the top of a report. You can subumit assigment though Assigument$=2$ frou your Moodle accout You have to submit java source file too.