哈希表实现电话查询系统

#include<iostream>
using namespace std;
struct Data
{
	char *name;
	char *phone;
	char *adress;
	Data *nextData;
};

class Hash
{
private:
	Data *phoneBook[8];



public:
	Hash();
 	void Add(char *name,char *phone,char *adress);
	void Search(char *phone);
	void Delete(char *phone);
};

Hash::Hash()
{
	for(int i=0;i<8;i++)
	{
		this->phoneBook [i]=NULL;
	}
}

void Hash::Add(char *name,char *phone,char *adress)
{
	
	int ii=0;
	for(int i=0;i<11;i++)
	{
		ii=(ii+int(phone[i]-48))%7;
	}

	Data *d=new Data;
	
	d->adress =adress;
	d->name =name;
	d->phone =phone;
	d->nextData =this->phoneBook [ii];
	this->phoneBook [ii]=d;

}


void Hash::Search(char *phone)
{
	int ii=0;
	for(int i=0;i<11;i++)
	{
		ii=(ii+int(phone[i]-48))%7;
	}

	Data *p=this->phoneBook [ii];
	while(p!=NULL&&strcmp(p->phone,phone)!=0)