/* Exercise on recursion */

public class VEBTest
{


   public static void main (String[] args)
   {
        int leftEnd, length;
        System.out.print("Left end of the tree's range:  ");
        leftEnd = SavitchIn.readLineInt();
        System.out.println(leftEnd);
        System.out.print("Length of the tree's range:  ");
   
        length = SavitchIn.readLineInt();
        System.out.println(length);
        
        VEBTree heap = new VEBTree(leftEnd, length);
        NaiveHeap NH = new NaiveHeap(leftEnd, length);

        int choice; // menu option choice
        do 
        {

            System.out.print ("\n\n ------------------------------ \n");
            System.out.print ("\n\n     MENU     \n\n");
            System.out.println ("0. Exit");
            System.out.println ("1. Insert an integer");
            System.out.println ("2. Find min");
            System.out.println ("3. Extract min");
            System.out.println ("4. Print contents");
            System.out.println ("5. Print side heap");
    
            System.out.print ("\n\n     Which? ");
            choice = SavitchIn.readLineInt();
            System.out.print ("\n");
            if (choice == 1)
            {
                int newVal;

                System.out.print ("\n\nInteger to insert: ");
                newVal = SavitchIn.readLineInt();
                System.out.println("\n" + newVal);
                if (heap.insert(newVal))
                    System.out.println("Successful");
                else
                    System.out.println("Unsuccessful");
            } 
            else if (choice == 2)
                System.out.println("Current min = " + heap.findMin());
            else if (choice == 3)
                System.out.println ("Extracted item: " + heap.extractMin());
            else if (choice == 4)
                heap.printContents();
            else if (choice == 5)
                heap.printSideHeap();
        } while (choice != 0);
   }
}