Write a java program that performs n operations (find, insert, and delete
Strings) on a AVL tree and tracks the performance (hint:
[login to view URL]()).
Your program must have at least one class called Driver2 which runs the program.
Your program must have the following class: [login to view URL] This class should have a no argument constructor and
implement the following interface.
public interface BalancedTree<E extends Comparable<E>> {
public void insert(E item);
public E find(E item);
public void delete(E item);
public void printInOrderTraversal();
public int isWellFormed();
}
The isWellFormed() method checks if the BST, AVL, Splay tree, and Trie is follows the
appropriate rules (0 for true and 1 for false).
I'm computer engineering TA with 10+ years of experience.
I'm experienced with Java SE,ME under netbeans,eclipse,JCreator
I'm experienced with data structures and algorithms , computation theory , discrete math and competitive programming
I'm experienced with the data structures and advanced data structures types
I'm experienced with the heap - heap sort - binary heap - fibonacci heap
I could help you making the full project working within few hours