static void Main(string[] args)
{
int SIZE = 8;
int[] a = new int[SIZE];
for (int i = 0; i < SIZE; i++)
{
a[i] = i * 2;
}
for (int i = 0; i < SIZE * 2; i++)
{
Console.WriteLine("Found " + i + " at " + BinarySearch(a, i));
}
Console.ReadKey();
//----------------------------------------------------
BinarySearchTree <int> t = new BinarySearchTree <int>();
const int NUMS = 40000;
const int GAP = 307;
Console.WriteLine("Checking... (no bad output means success)");
for (int i = GAP; i != 0; i = (i + GAP) % NUMS)
{
t.Insert(i);
}
Console.WriteLine("Inserts complete");
for (int i = 1; i < NUMS; i += 2)
{
t.Remove(i);
}
Console.WriteLine("Removes complete");
if (t.FindMin() != 2 || t.FindMax() != NUMS - 2)
{
Console.WriteLine("FindMin or FindMax error!");
}
for (int i = 2; i < NUMS; i += 2)
{
if (t.Find(i) != i)
{
Console.WriteLine("Error: find fails for " + i);
}
}
for (int i = 1; i < NUMS; i += 2)
{
if (t.Contains(i))
{
Console.WriteLine("Error: Found deleted item " + i);
}
}
Console.ReadKey();
}
