Java - Please provide formatted code. Thanks

Implement a method Insert (T data) to insert a node having value of key data in a Binary Search Tree. Implement In-order Traversal that prints the elements of the BST in an in-order format. If your insertion of elements in the BST is correct, then the in-order traversal output should print the elements in a sorted order. Write a driver program to test the Binary Search Tree program. Make sure you use all the methods implemented above Implement Search (T data) to search for a node having value of key data in a Binary Search Tree