数据结构关于集合的运算.docVIP

#includeiostream.h #includestdlib.h #include stdio.h template class T class node { public: node(){link=NULL;} node(T e,node* next) { data=e; link=next; } T data; nodeT *link; }; templateclass T class set { nodeT * head; public: set(){head=NULL;} ~set(); set(setT a); void sethead(nodeT* p){head=p;} nodeT* gethead(){return head;} void operator =(setT a); void create(); setT jiao(setT set1); private: void output(ostream out); friend ostream operator(ostream out,setT q); }; template class T void setT::create () { nodeT *p,*q; p=NULL;q=NULL;head=NULL; T e;char c; cout输入数据？(y/n)endl; while ((c=getchar())==\n); while (tolower(c)!=n) { cine;p=new nodeT(e,NULL); p-link=head; head=p; cout输入数据？(y/n)endl; while ((c=getchar())==\n); } } template class T setT::~set () { nodeT *p; p=head; while (head) { p=head-link; delete head; head=p; } } template class T void setT::output (ostream out) { nodeT *p=head; while (p) { outp-data ; p=p-link; } outendl; } template class T setT::set(setT a) { nodeT *q,*h1=NULL; q=a.gethead(); while (q) { h1=new nodeT(q-data,h1); } head=h1; } template class T setT setT::jiao (setT set1) { nodeT *p,*q,*head1=NULL; p=head; while (p) { q=set1.gethead(); while(q) { if (p-data!=q-data) { q=q-link; } else { break; } } if (q!=NULL) { head1=new nodeT(p-data,head1); } p=p-link; } p=head; while (head) { p=head-link; delete head; head=p; } head=head1; return *this; } template class T void setT::operator = (setT a) { nodeT *p=head; while (head) { p=head-link; delete head; head=p; } nodeT *q; q=a.gethead(); while (q) { head=new nodeT(q-data,head); } } templateclass T ostream operator(ostream out,setT q) { q.output(out); return out; } void main() { setint a,b;