// use this program to test your BST/AVL tree implementation.
import avltree.*;
import java.util.Scanner;

public class avltest {
  public static void main(String[] av)
    {
	AVLSet<Integer> tree = new AVLSet<Integer>();
	//BstSet<Integer> tree = new BstSet<Integer>();
	int n = 20000;
        if (av.length>1) n = Integer.parseInt(av[1]);
	
	//while(n-->0) tree.insert((int)(Math.random()*n*n));
	while(n-->0) tree.insert(n*4);
	tree.map_inorder(x -> System.out.print(x+" "));
	System.out.println();

	BstGraph W = new BstGraph(800,600);
	W.draw(tree);
	W.draw(tree); // get rid of weird colors?

        // interactive loop
        Scanner scin = new Scanner(System.in);
        String req = "";  // user request
        do {
            System.out.print("add n or del n or quit: ");
            req = scin.next(); // read next token
            if (req.equals("add")) tree.insert(scin.nextInt());
            else if (req.equals("del")) tree.remove(scin.nextInt());
            W.draw(tree);
	    W.display_string("size "+tree.size()+", height "+tree.depth(),10,570);
        } while (req.equals("add") || req.equals("del"));
        W.close();
    }//main
}//avltest