// requires Bst.java, Bstgraph.java
public class testbst
{
    public static void main(String[] av) 
    {
	int n = 50; // number of nodes
	if (av.length>0) n = Integer.parseInt(av[0]); // set by command param
        Bstgraph W = new Bstgraph(1600,1024); // for graphical rendering	
	Bst<Integer> tree = new Nil<Integer>(); // start with empty tree
	for(int i=0;i<n;i++)
	    {
	      tree = tree.insert(i);
	      W.drawtree(tree);
	      try {Thread.sleep(150);} catch(Exception exc){}
	    }
	for(int i=0;i<n-1;i+=2) tree=tree.delete(i);
	System.out.println(tree.size());
	System.out.println(tree.depth());
	System.out.println(tree.height());
        try {Thread.sleep(10000);} catch(Exception exc){} //10 sec delay	
	W.drawtree(tree);
	
	if (n<100) System.out.println(tree);
	tree = new Nil<Integer>(); // reset to empty tree
	for(int i=0;i<n;i++)
	    tree = tree.insert((int)(Math.random()*n*100));
	System.out.println(tree.size());	
	System.out.println(tree.depth());
	System.out.println(tree.height());
	//	W.drawtree(tree);
    }//main
}