C++ BSTree::find方法代码示例

int main()
{	
	BSTree tree;   // The binary search tree to be tested
	char command;  // The command entered by the user (I, N, F, D, L, or P)
	int item;      // The item to have the action performed on
	
	cin >> command;
	
	while (cin)
	{
		switch (command)
		{
			case 'I':
				tree.initialize();
				break;
			case 'N':
				cin >> item;
				tree.insert(item);
				break;
			case 'F':
				cin >> item;
				cout << item << " ";
				if (tree.find(item))
					cout << "Found" << endl;
				else
					cout << "Not Found" << endl;
				break;
			case 'D':
				cin >> item;
				tree.del(item);
				break;
			case 'L':
				tree.inorder(cout);
				break;
			case 'P':
				tree.preorder(cout);
				break;
			default:
				cout << "Illegal Command" << endl;
				cin.clear();
				cin.ignore(255, '\n');
				break;
		}
		cin >> command;
	}
}

void BinarySearchTreeTest(int nmbItems)
{
	int i=0;
	int value;

	BSTree *BinarySearchTree = new BSTree();
	
	while (i < nmbItems)
	{
		value = rand()%10;		// Random integer value
		cout << value;
		if (i < (nmbItems-1))
			cout << ", ";
		BinarySearchTree->insert(value);
		i++;
	}

	cout << endl;
	cout << "Entered " << nmbItems << " random values into BSTree Data Structure ..." << endl;

	cout << endl << "Preorder Traversal: ";
	BinarySearchTree->BSTreeTraverse(PREORDER);

	cout << endl << "Inorder Traversal: ";
	BinarySearchTree->BSTreeTraverse(INORDER);

	cout << endl << "Post order Traversal: ";
	BinarySearchTree->BSTreeTraverse(POSTORDER);

	cout << endl;
	cout << "Search for a value in the tree: ";
	cin >> value;

	if (BinarySearchTree->find(value))
		cout << "Found " << value;
	else
		cout << "Could not find " << value;
	cout << endl;
	BinarySearchTree->~BSTree();
}

int main(){
	srand(time(NULL));
  	cerr << "\n\tTEST #0: Passes all tests from Lab 6" << endl;
	BSTree tree;
	assert(tree.empty());
	int array[] = {5,3,10,4,8,2,1,7,9,6,12,11,13};
	for(unsigned int i = 0; i < sizeof(array)/sizeof(int); i++){
		tree.insert(array[i]);
    	assert(!tree.empty());
	}
	//retest inserting duplicate values
	for(int i = 0; i < 8; i++){
		assert(!tree.insert(array[i]));
	}
	for(int i = 1; i <= 14; i++){
		if(i != 14){
			assert(tree.find(i));
		}else
			assert(!tree.find(i));
	}
	BSTree tree3;
	assert(!tree3.find(1));
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #1: Cannot remove node that is not in the tree" << endl;
	assert(!tree.remove(25));
	vector<int> test1;
	tree.sortedArray(test1);
	printList(test1);
	assert(test1.size() == 13);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #2: Remove a leaf node" << endl;
	assert(tree.remove(1));
	vector<int> test2;
	tree.sortedArray(test2);
	printList(test2);
	assert(test2.size() == 12);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #3: Remove single branch using the Short Circuit algorithm" << endl;
	assert(tree.remove(7));
	vector<int> test3;
	tree.sortedArray(test3);
	printList(test3);
	assert(test3.size() == 11);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "Test #4: Remove two branch node promoting a leaf node" << endl;
	assert(tree.remove(10));
	vector<int> test4;
	tree.sortedArray(test4);
	printList(test4);
	assert(test4.size() == 10);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #5: Remove two branch node promoting a 1 branch node using Short Circuit" << endl;
	assert(tree.remove(11));
	vector<int> test5;
	tree.sortedArray(test5);
	printList(test5);
	assert(test5.size() == 9);
	cerr << "\n\t========================PASS========================\n" << endl;

	

	cerr << "\n\tTEST #6: Remove root with two branches" << endl;
	assert(tree.remove(5));
	vector<int> test6;
	tree.sortedArray(test6);
	printList(test6);
	assert(test6.size() == 8);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #7: Remove root with one branch" << endl;
	assert(tree.remove(3));
	assert(tree.remove(4));
	assert(tree.remove(2));
	assert(tree.remove(6));
	vector<int> test7;
	tree.sortedArray(test7);
	printList(test7);
	assert(test7.size() == 4);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #8: Remove root as leaf" << endl;
	assert(tree.remove(9));
	assert(tree.remove(8));
	assert(tree.remove(13));
	assert(tree.remove(12));
	vector<int> test8;
	tree.sortedArray(test8);
	printList(test8);
	assert(test8.size() == 0);
	cerr << "\n\t========================PASS========================\n" << endl;

	cerr << "\n\tTEST #9: Deep copy for a tree of 100 random values" << endl;
	for(int i = 0; i < 100; i++){
		int value = rand() % 1000;
		tree.insert(value);
//.........这里部分代码省略.........