#include <iostream.h>

#include "AvlTree.h"

// Test program

int main( )

{

const int ITEM_NOT_FOUND = -9999;

AvlTree<int> t( ITEM_NOT_FOUND ), t2( ITEM_NOT_FOUND );

int NUMS = 40000;

const int GAP = 37;

int i;

cout << "Checking... (no more output means success)" << endl;

for( i = GAP; i != 0; i = ( i + GAP ) % NUMS )

t.insert( i );

if( NUMS < 40 )

t.printTree( );

if( t.findMin( ) != 1 || t.findMax( ) != NUMS - 1 )

cout << "FindMin or FindMax error!" << endl;

t2 = t;

for( i = 1; i < NUMS; i++ )

if( t2.find( i ) != i )

cout << "Find error1!" << endl;

if( t2.find( 0 ) != ITEM_NOT_FOUND )

cout << "ITEM_NOT_FOUND failed!" << endl;

return 0;

}