TreeTest Class Reference

List of all members.

---

Detailed Description

Unit test for the BinaryTree class.

Static Public Member Functions
void	main (String argv[])
Private Member Functions
boolean	equals (Object[] treeArray, OrderedVector ordVec)
void	treeTest ()
	Test that values in the BinaryTree object are ordered properly and that object delete works properly.

---

Member Function Documentation

boolean TreeTest.equals (  Object[]  treeArray, OrderedVector  ordVec )  [private]

{ boolean rslt = true; if (ordVec.size() != treeArray.length) { rslt = false; } else { for (int i = 0; i < treeArray.length; i++) { Integer i1 = (Integer)treeArray[i]; Integer i2 = (Integer)ordVec.elementAt(i); if (i1.compareTo(i2) != 0) { rslt = false; break; } } } return rslt; } // equals

void TreeTest.main (  String  argv[]  )  [static]

{ TreeTest test = new TreeTest(); test.treeTest(); }

void TreeTest.treeTest (   )  [private]

Test that values in the BinaryTree object are ordered properly and that object delete works properly. This test builds an ordered Vector which mirrors the ordered contents of the binary tree. Elements are removed from the tree and from the ordered vector. A check is then made that both the ordered vector and the contents of the tree are the same. This is a test, so no thought is given to efficiency. { Random rand = new Random( 127 ); IntegerComparator compare = new IntegerComparator(); BinaryTree tree = new BinaryTree( compare ); final int INT_RANGE = 0xffff; final int NUM_VALS = 256; OrderedVector ordVec = new OrderedVector(); for (int i = 0; i < NUM_VALS; i++) { int iRand = rand.nextInt( INT_RANGE ); Integer I = new Integer( iRand ); tree.insert( I ); ordVec.add( I ); } // for if (!equals(tree.toArray(), ordVec)) { System.out.println("Initially, tree array and ordered vector are not equal"); } else { final int NUM_TO_REMOVE = NUM_VALS / 2; boolean testPassed = true; int count = 0; while (count < NUM_TO_REMOVE) { int range = ordVec.size(); int index = rand.nextInt( range ); Integer intObj = (Integer)ordVec.elementAt( index ); ordVec.remove( index ); tree.delete( intObj ); if (!equals(tree.toArray(), ordVec)) { testPassed = false; break; } count++; } // while if (testPassed) { System.out.println("Test passed"); } else { System.out.println("Test failed"); System.out.println("count = " + count ); } } }

---

The documentation for this class was generated from the following file:

• TreeTest.java

---