### Write findmin and findmax methods for the avltree class

Assignment Help Basic Computer Science
##### Reference no: EM131313326

1. Write FindMin and FindMax methods for the AVLTree class.

2. Using the Timing class, compare the times for the methods implemented in Exercise 1 to the same methods in the BinarySearchTree class. Your test program should insert a sorted list of approximately 100 randomly generated integers into the two trees.

#### What is the ranking of the algorithms

To perform the tests, create a randomly generated array of 1,000 elements. What is the ranking of the algorithms? What happens when you increase the array size to 10,000 ele

#### Create a new hash class that uses an arraylist

Using the Hashtable class, write a spelling-checker program that reads through a text file and checks for spelling errors. You will, of course, have to limit your dictionary

#### Determine the number of the last person left in the circle

Write a program that allows you to place n people in a circle and specify that every mth person will be killed. The program should determine the number of the last person le

#### Display a list of each of the integers

Write a program that generates 10,000 random integers in the range of 0-9 and stores them in a binary search tree. Using one of the algorithms discussed in this chapter, dis

#### Display all the words in the file

Write a program that generates 10,000 random integers in the range of 0-9 and stores them in a binary search tree. Using one of the algorithms discussed in this chapter, dis

#### Bit array implementation

Both implementations should use the same sets. Using the Timing class, compare the major operations (union, intersection, difference, and subset) of each implementation and

#### Write a windows application to test your implementation

Using the implementation of the IPAddresses class developed in this chapter, devise a method that displays the IP addresses stored in the class in ascending order. Use the m

#### Rewrite the longest common substring code as a class

Write a program that uses a brute-force technique to find the longest common substring. Use the Timing class to compare the brute-force method with the dynamic programming m