双向链表类模板.cpp

c++算法的很经典的一些小练习 看了 觉得还可以 给大家分享一下！

#include<iostream.h>
#include<string.h>

template<typename T>class DblList;
template<typename T>class DblNode{
	T info;
	DblNode<T>*llink,*rlink;
	public:
		DblNode();
		DblNode(T data);
		T Getinfo(){return info;};		 
		friend class DblList<T>;
};
template<typename T>DblNode<T>::DblNode(){llink=rlink=NULL;}
template<typename T>DblNode<T>::DblNode(const T data){
	info=data;
	link=NULL;
	rink=NULL;
}
template<typename T>class DblList{
	DblNode<T>*head,*current;
	public:
		DblList();
		~DblList();
		void MakeEmpty();
		DblNode<T>*Find(T data);
		int Length();
		void Print();
		void Insert(const T&data);		
		DblNode<T>*Remove(DblNode<T>*p);
};
template<typename T>DblList<T>::DblList(){/////
	head=tail=new DblNode<T>();
	head->rlink=head->llink=head;
	current=NULL;
}
template<typename T>DblList<T>::~DblList(){////
	MakeEmpty();
	delete head;
}
template<typename T>void DblList<T>::MakeEmpty(){////
	DblNode<T>*tempP;
	while(head->rlink!=head){
		tempP=head->rlink;
		head->rlink=tempP->rlink;
		tempP->rlink->llink=head;
		delete tempP;
	}
	current=NULL;
}
template<typename T>DblNode<T>*DblList<T>::Find(T data){//////
	current=head->link;
	while(current!=head&&current->info!=data)current=current->rlink;
	if(current==head)current=NULL;
	return current;
}
template<typename T>int DblList<T>::Length(){//////
	int count=0;
	current=head->rlink;
	while(current!=head){
		current=currnt->link;
		count++;
	}
	return count;
}
template<typename T>void DblList<T>::Print(){//////
	current=head->rlink;
	while(current!=head){
		cout<<current->info<<'\t';
		current=current->rlink;
	}
	cout<<endl;
}
template<typename T>void DblList<T>::Insert(const T&data){//////
	current=new DblNode<T>();//////
	current->info=data;
	current->rlink=head->link;	
	head->llink->rlink=currnt;
	head->llink=current;
}
template<typename T>void DblList<T>::Remove(DblNode<T>*p){////
	current=head->rlink;
	while(current!=head&&current!=p)current=current->rlink;
	if(current==head)current=NULL;
	else{
		p->llink->rlink=p->rlink;
		p->rlink->llink=p->llink;
		p->rlink=p->llink=NULL;
	}
	return current;
}

void main(){
	DblNode<int>*tp=NULL;
	DblList<int> Dbl1;
	int i,a[11]={19,11,17,13,7,2,3,5,23,31,29};
	for(int i=0;i<11;i++)Dbl1.Insert(a[i]);
	cout<<"双向链表的长度:"<<Dbl.Length()<<endl;
	Dbl.Print();
	if(tp)cout<<"查到的结点数据为:"<<tp->Getinfo()<<""<<endl;
	delete Dbl1.Remove(tp);
    cout<<"双向链表的长度:"<<Dbl.Length()<<endl;
	Dbl.Print();
	cout<<"清空链表!"<<endl;
	Dbl.MakeEmpty();
	cout<<"双向链表的长度:"<<Dbl.Length()<<endl;
}