/*
 * Jacqueline Feild
 * November 17, 2012
 */

public class disc10_testDriver {

	public static void main(String[] args) {

		//inits
		BinarySearchTree<Integer> bst; 
		CardDeck deck = new CardDeck();
		int card;
		int d =0;
		int counter = 0;
		double numExperiments = 1000;
		int minDepth = 100;
		int maxDepth = 0;
		
		for(int i=0; i<numExperiments; i++)
		{
			//Add each card to a binary search tree
			bst = new BinarySearchTree<Integer>();
			deck.shuffle();

			while(deck.hasMoreCards()==true)
			{
				card = deck.nextCard();
				bst.add(card);	
			}
			
			//Find the depth of the tree
			d = bst.depth();
			
			if(d<minDepth)
				minDepth = d;
			
			if(d>maxDepth)
				maxDepth = d;
			
			counter += d;
		
		}
		
		System.out.println("The minimum depth of a binary search tree is " + minDepth);
		System.out.println("The maximum depth of a binary search tree is " + maxDepth);
		System.out.println("The average depth of a binary search tree is " + 
							counter/numExperiments);

	}

}