/* File: TreeTest.java */
/* Description: Contains a main function to test tree traversals. */

import BinTree.*;
import java.util.Enumeration;

public class TreeTest {

  public static void main (String [] argv) {
    BinTree bt = new BinTree("A");
    bt.addLeft("B");
    bt.addRight("C");
    bt.getLeft().addLeft("D");
    bt.getLeft().addRight("E");
    bt.getRight().addLeft("F");
    bt.getRight().addRight("G");
    bt.getLeft().getRight().addRight("H");

    // test each type of traversal
    Preorder pre = bt.getPreorder();
    testEnum( pre );

    Postorder post = bt.getPostorder();
    testEnum( post );

    // Inorder in = bt.getInorder();
    // testEnum( in );
  }

  private static void testEnum( Enumeration e ) {
    while (e.hasMoreElements()) {
       System.out.print(e.nextElement() + " ");
    }
    System.out.println("");
  }

}