void testMember () { BinTree<int> t; t.add(10,"").add(12,"L").add(14,"R").add(15,"LR"); assert (t.member(12) == true); assert (t.member(18) == false); assert (t.member(15) == true); }
void testAssignment() { BinTree<int> t; t.add(10,"").add(12,"L").add(14,"R").add(15,"LR"); simplePrint(t); BinTree<int> t1; t1 = t; assert (t1.member(10) && t1.member (12) && t1.member (14) && t1.member (15)); }
void main() { BinTree btr; btr.add( 7, "seven" ); btr.add( 3, "three" ); btr.add( 5, "five" ); btr.add( 2, "two" ); btr.add( 2, "two" ); btr.add( 4, "four" ); btr.add( 6, "six" ); btr.add( 1, "one" ); btr.add( 9, "nine" ); btr.add( 11, "eleven" ); btr.add( 10, "ten" ); btr.add( 8, "eight" ); btr.add( 12, "twelve" ); btr.add( -1, "minus one" ); cout <<btr; cout <<"\n\n _______ find _____\n"; const char * pText; pText = btr.find( 3 ); cout <<"found text: '" <<( pText ? pText : "--none--" ) <<"'\n\n"; pText = btr.find( 6 ); cout <<"found text: '" <<( pText ? pText : "--none--" ) <<"'\n\n"; pText = btr.find( 8 ); cout <<"found text: '" <<( pText ? pText : "--none--" ) <<"'\n\n"; cout <<"\n\n _______ getMaxKey, getMinKey _____\n"; int key; btr.getMaxKey(key); cout <<"maximal key: " <<key <<"\n"; btr.getMinKey(key); cout <<"minimal key: " <<key <<"\n"; cout <<"\n\n _______ deleted 8 _____\n"; cout <<"removeByKey ...\n"; btr.removeByKey( 8 ); cout <<"removeByKey ... finished\n"; cout <<"\n\n Try to find 8... \n"; pText = btr.find( 8 ); cout <<"found text: '" <<( pText ? pText : "--none--" ) <<"'\n\n"; cout <<btr; cout <<"\n\n\n"; }