Objective: The goal of this assignment is to practice implementing binary search tree Assignment: The instructor of CS 2401 had already written all the three files for you that are required for this assignment BTNode.java, BST java, and Runner java BTNode java can be used as the node of any binary tree. It is provided below class BTNodef Object data BTNode lefti BTNode righti BTNode0 BTNode (Object obj) [ data-obj Runner.java is the class that tests if the binary search tree provided in BSTjava works well. The code for Runner java is here class Runner ( public statie vold maintStzingti azgs) bst.Insert("Monkey bst.insert(Jaquar) bst.insert(Rabbi bst.inser: Platypus) bst.insert"Giratte bst.insert("K1ipopringer") bst.insert(Vicuna" bst.insert"Ouokka System, out printin System.out-print in("Printing BST: bst.printBTO System.out print ("Total nunber of nodes: System.out.println(bst.size0) System.out.println( )a Syscem.out-printint"Pznting BSTin asconding ozder: bst.printiscending) System. out.println System.out-println("Printing BST n descending order:" bst.printDescendingO System.out.printin( System.out.print ("The longest string System. out.print In (bst.getlongeststring))