(Solved) : Datacount Binarysearchtree Wordcountjava Import Javaioioexception Import Javautilarrays Im Q29984214 . . . .

Can you do for DataCount andBinarySearchTree??

WordCount.java

—————————————

import java.io.IOException;
import java.util.Arrays;
import java.util.Comparator;

public class WordCount {
public static void main(String[] args) {
if(args.length != 3) {
System.out.println(“Usage: [-b | -a | -h] [-frequency |-num_unique] <filename>n”);
System.out.println(“-b – Use an Unbalanced BST”);
System.out.println(“-a – Use an AVL Tree”);
System.out.println(“-h – Use a Hashtablen”);
System.out.println(“-frequency – Print all the word/frequencypairs, ” +
“ordered by frequency, and then by the words in” +
“lexicographic order.n”);
System.out.println(“-num_unique – Print the number of unique wordsin the document. ” +
“This is the total number of distinct (different) words in thedocument. ” +
“Words that appear more than once are only counted as a single wordfor ” +
“this statistic”);
return;
}

try {
switch(args[1]) {
case “-frequency”:
countWordFrequencies(countWords(args[0],