Write a java program to create and do operations on a binary search tree

Given: + a file containing a class for binary tree nodes called “[login to view URL]”. + a template file called “[login to view URL]” (with description inside, to fill-in with your own codes). + a template file called “[login to view URL]” (its description is below, to fill-in with your own codes). + sample input files “[login to view URL]” and “[login to view URL]” and expected result “[login to view URL]”. + a sample screen output (expected for given treeA and treeB), in the file “[login to view URL]”. Build: + a class for processing binary search trees called BinarySearchTree (see “[login to view URL]” for more details on some methods). The template is at “[login to view URL]”. + a class/program called BinarySearchTree_TEST(the template is at “[login to view URL]”.) which uses the two above classes to do the following: 1) Input(read) a binary search treeA from a text file called “[login to view URL]” using Preorder Traversal method. 2) Print treeA 3 times on the screen using: inorderPrint(), preorderPrint(), postorderPrint() traversal methods and display it using the print(10) method in BinaryTreeNode. 3) Input(read) a binary search treeB from a file called “[login to view URL]” using Preorder Traversal method. 4) Display treeB on the screen (using the print(10) method in BinaryTreeNode). 5) Add treeB to treeA. The new tree is called C. Display treeC and write it to a file called “[login to view URL]”. 6) Let the user enter a node value (an integer) Z. Count how many times this node/value occurs in treeC. 7) Make a copy of treeC. The new tree is called treeD. Display treeD. 8) Calculate the size of treeD and print out its size. 9) Let the user enter a node value (an integer) X. Add this node X to tree C and display the new treeC. 10) Let the user enter a node value (an integer) Y. Remove this node Y from tree D and display the new treeD. (*) Display means to print out a tree using the print(10) method in BinaryTreeNode class. MORE DETAILED DESCRIPTION IN THE PROJECT FILES UPLOADED