Intermediate Java homework Due Friday 12pm GMT -8

Hi everyone, the assignment instruction is attached with the two other files for input information. It is due friday at 12pm GMT -8 March 20. Binary Search Trees You are given an input ASCII text file containing an arbitrary number of student records in the following format: Operation code: 1 character ('I' for insert, 'D' for delete) Student number: 7 characters Student last name: 25 characters Home department: 4 characters Program: 4 characters Year: 1 character Each record is stored as one line in the text file; i.e. there is a newline character immediately following the year. Create a Java program that does the following: 1. Build a binary search tree using the data from the input file. Both insertion into and deletion from the tree will be done. The tree should be ordered by student last name (use a case-insensitive comparison). There are only unique records in the input file. Each node must contain the student data (exclude the operation code), a left child pointer, and a right child pointer. A parent pointer is optional, but might prove useful for some operations. 2. Traverse the binary search tree recursively, printing out the nodes in ascending logical order; i.e. do a depth-first, in-order tree traversal. Print the node data to a text file. 3. Traverse the binary search tree, starting at the top level (the root node), proceeding downwards level-by-level. At each level print out the nodes from left to right. In other words, do a breadth-first traversal. You may have to use a queue to implement this. Print the node data to a text file. Be sure to use proper headings and fixed-width columns for both of the output files. The program will be invoked from the command line as follows: java Assign3 input output1 output2 where Assign3 is the name of the file containing executable bytecode for your program, input is the name of the input text file, output1 is the name of the text file containing node data from the depth-first, in-order tree traversal, and output2 is the name of the text file containing node data from the breadth-first traversal. If the command line arguments are improperly specified, the program should print out a “usage” message and abort. Be sure that the specified files can be opened or created. Create your own input files to test your code. Start with a file that specifies only insertions of data into the tree. Later on, you should create a second file that also specifies some deletions as well. An official input file will be made available on D2L; use this file to create your output files. Your program must be able to handle deletions from the binary search tree. For this, your program will need to examine the first field (the operation code) in each record of the input file. If it is the character 'D', then delete the node that matches from the tree. If there is no match, then report the error to standard output. You must program all the data structures for this assignment from scratch; in other words, do not use any classes from the Java libraries to implement the binary search tree or queue.