Esempio n. 1
0
void TestAVLTree(int argc, char **argv)
{
	int array[TREE_SIZE];
	int seed;
	bool IsInsert;

	if (argc == 2)
		seed = atoi(argv[1]);
	else
		seed = time(0) *257%32768;

	SimpleCompareNodesAlgorithm<int, int> CompareAlgorithm;

	for (int iteration = 1; iteration <= N_ITERATIONS; iteration++)
	{
		AVLTree<int, int> *tree;
		int i;

		printf("Iteration %4d/%4d: seed=%5d", iteration, N_ITERATIONS, seed);
		fflush(stdout);

		srand(seed++);

		for (i = 0; i < TREE_SIZE; i++)
			array[i] =  i;

		Shuffle(array, TREE_SIZE);

		tree = new AVLTree<int, int>(&CompareAlgorithm);
		for (i = 0; i< TREE_SIZE; i++)
			tree->Search(&(array[i]), &IsInsert);
		
//		if (tree->Verify(&IsDone))
//			return;

		for(i = 0; i < TREE_SIZE; i++)
		{
			tree->Delete(&(array[i]));

//			if (tree->Verify(&IsDone))
//				return;
		}

		printf("\ttest good.\n");
		fflush(stdout);

		delete tree;
	}
}
Esempio n. 2
0
int main()
{
	AVLTree<int> itree;

	std::cout << "Insert 0 9 4 6 -4 -2 -1\n";
	itree.Insert(0);
	itree.Insert(9);
	itree.Insert(4);
	itree.Insert(6);
	itree.Insert(-4);
	itree.Insert(-2);
	itree.Insert(-1);
	
	std::cout << "InOrder traverse:\n";
	itree.InOrderTraverse();
	std::cout << "PreOrder traverse:\n";
	itree.PreOrderTraverse();

	std::cout << "Deleted 9:\n";
	itree.Delete(9);
	std::cout << "InOrder:\n";
	itree.InOrderTraverse();
	std::cout << "PreOrder:\n";
	itree.PreOrderTraverse();

	std::cout << "Deleted 4:\n";
	itree.Delete(4);
	std::cout << "InOrder:\n";
	itree.InOrderTraverse();
	std::cout << "PreOrder:\n";
	itree.PreOrderTraverse();

	std::cout << "Deleted 0:\n";
	itree.Delete(0);
	std::cout << "InOrder:\n";
	itree.InOrderTraverse();
	std::cout << "PreOrder:\n";
	itree.PreOrderTraverse();

	std::cout << "Deleted -2:\n";
	itree.Delete(-2);
	std::cout << "InOrder:\n";
	itree.InOrderTraverse();
	std::cout << "PreOrder:\n";
	itree.PreOrderTraverse();

	std::cout << "Deleted 6:\n";
	itree.Delete(6);
	std::cout << "InOrder:\n";
	itree.InOrderTraverse();
	std::cout << "PreOrder:\n";
	itree.PreOrderTraverse();
//-----------------------------------------------------------------------------------------
	AVLTree<std::string> strTree;

	std::cout << "Inserted 5 string: rensehngqiang shibojun lijin wangzaibing zhaogang\n";
	strTree.Insert("renshengqiang");
	strTree.Insert("shibojun");
	strTree.Insert("lijin");
	strTree.Insert("wangzaibing");
	strTree.Insert("zhaogang");

	std::cout << "InOrder traverse:\n";
	strTree.InOrderTraverse();
	std::cout << "PreOrder traverse:\n";
	strTree.PreOrderTraverse();

	std::cout << "Look for lijin:\n";
	AVLTreeNode<std::string> *pNode = strTree.Search("lijin");
	if(pNode != 0) std::cout << pNode->element << std::endl;

	std::cout << "Look for huangliangyu\n";
	pNode = strTree.Search("huangliangyu");
	if(pNode != 0) std::cout << pNode->element << std::endl;

	return 0;
}