testorderediteratedsimpletree.java

来自「国外的数据结构与算法分析用书」· Java 代码 · 共 48 行

public class TestOrderedIteratedSimpleTree
{
    	OrderedIteratedSimpleTree t;
	public TestOrderedIteratedSimpleTree()
    	{
		t = new OrderedIteratedSimpleTree();
		makeTree();
		System.out.println("");
		t.goFirst();
		while(!t.after())
		{
			System.out.print(t.item()+" ");
			t.goForth();
		}
		System.out.println("");
    }
    
    	/** Create an ordered binary tree
     		Analysis: Time = (1)	*/
   	public void makeTree()
    	{
		OrderedIteratedSimpleTree t1, t2, t3, t4;
		t1 = new OrderedIteratedSimpleTree(null, new Integer(6), null);
		t2 = new OrderedIteratedSimpleTree(null, new Integer(2), t1);
		t1 = new OrderedIteratedSimpleTree(null, new Integer(18), null);
		t3 = new OrderedIteratedSimpleTree(null, new Integer(16), t1);
		t1 = new OrderedIteratedSimpleTree(null, new Integer(21), null);
		t4 = new OrderedIteratedSimpleTree(t3, new Integer(19), t1);
		t3 = new OrderedIteratedSimpleTree(t2, new Integer(14), t4);
		t1 = new OrderedIteratedSimpleTree(null, new Integer(31), null);
		t2 = new OrderedIteratedSimpleTree(null, new Integer(25), t1);
		t4 = new OrderedIteratedSimpleTree(t2, new Integer(36), null);
		t = new OrderedIteratedSimpleTree(t3, new Integer(23), t4);
		System.out.println(t);
    	}

    	public static void main(String args[])
    	{
		TestOrderedIteratedSimpleTree c = new TestOrderedIteratedSimpleTree();
    	}
}