import binaryTree.BiTree;
import binaryTree.visitor.*;

/**
* Driver to test the primitive structural behaviors of a BiTree and
* the vertical tree printing algorithm
* @author Dung X. Nguyen
*/
public class BiTreeClient
{
	/**
	 * @param args == null - not used.
	 */
	public static void main(String[] args)
	{
      BiTree t0 = new BiTree ();
      t0.insertRoot (new Integer (15));
      System.out.println ("t0's root = " + t0.getRootDat());
      System.out.println ("t0.remRoot () returns " + t0.remRoot ());

      BiTree t1 = new BiTree ();
      t1.insertRoot (new Integer (-7));
      BiTree t2 = new BiTree ();
      t2.insertRoot (new Integer (3));
      t1.setLeftSubTree(t0);
      t1.setRightSubTree (t2);
      try
      {
         t1.remRoot ();
      }
      catch (Exception e)
      {
         e.printStackTrace();
      }

      Integer level0 = new Integer (0);
      System.out.println ("t0 is ");
      t0.execute (VerticalPrinter.Singleton, level0);
      System.out.println('\n');
      System.out.println ("t2 is ");
      t2.execute (VerticalPrinter.Singleton, level0);
      System.out.println('\n');
      System.out.println ("t1 is ");
      t1.execute (VerticalPrinter.Singleton, level0);
	}
}