A Sieve of Eratosthenes class

This simple class allows for the creation of a Sieve of Eratosthenes
which constructs a boolean array that stores if a particular value (or
value + an offset if a range of values is given) is composite. The user
can then ask if a particular value within the range is prime or for all
the primes in sieve as well as the number of primes in the sieve.
Indexed Binary Search Tree

It is based on an implementation I of a standard BST I found online at
cprograming.com (as of 1/14/14 it is lesson 18) with a few
modifications based on my personal taste and what the assignment called
for.

Feel free to use it/if you see any issues, let me know so I can fix it
before I turn it in.
Minor Fix

I had forgotten to get the getIndex method (duh!) and found a few small
errors.