/*  File: TreeTest.java
    Developed for Problem Solving with Java, Koffman & Wolz
    Appears in Figure 12.29
*/
public class TestTree {

	public static void main (String[] args) {
		SearchTree t = new SearchTree();

		// Insert 12 names and nicknames in the tree
		t.insert("Richard");
		t.insert("Debbie");
		t.insert("Robin");
		t.insert("Chris");
		t.insert("Jacquie");
		t.insert("Jeff");
		t.insert("Dustin");
		t.insert("Richie");
		t.insert("Deborah");
		t.insert("Jeffrey");
		t.insert("Jacqueline");
		t.insert("Christopher");

		// Display the tree contents.
		System.out.println(t.toString());
	}
} // class TreeTest