模板链表Link<T>的含义

系统管理员 2022-05-27 07:00 101阅读 0赞

给出实例：

\#include<iostream>  
\#include<string>  
using namespace std;  
  
  
class Student  
\{  
private:  
int ID;  
string name;  
public:  
Student() \{\}  
Student(int ID, string name) :ID(ID), name(name) \{\}  
void display()  
\{  
cout << ID << '\\t' << name << endl;  
\}  
\};  
class Pet  
\{  
private:  
string name;  
string owner;  
public:  
Pet() \{\}  
Pet(string name, string owner) :name(name), owner(owner) \{\}  
void display()  
\{  
cout << name << '\\t' << owner << endl;  
\}  
\};  
template<typename T>  
class Node  
\{  
public:  
**T data;**  
Node<T> \*pNode;  
Node() :pNode(nullptr) \{\}  
Node(T& data) :data(data), pNode(nullptr) \{\}  
Node(Node<T> &n) :data(n.data), pNode(nullptr) \{\}  
void display()  
\{  
data.display();  
\}  
\};  
template<typename T>  
class Link  
\{  
private:  
Node<T> \*head;  
public:  
Link()  
\{  
head = new Node<T>();  
\}  
~Link()  
\{  
while (head != nullptr)  
\{  
Node<T> \*p = head->pNode;  
delete(head);  
head = p;  
\}  
\}  
void display()  
\{  
Node<T> \*p = head->pNode;  
while (p != nullptr)  
\{  
p->display();  
p = p->pNode;  
\}  
\}  
void insert(Node<T> &n)  
\{  
Node<T> \*p = head;  
while (p->pNode != nullptr)  
\{  
p = p->pNode;  
\}  
Node<T> \*node = new Node<T>(n);  
p->pNode = node;  
\}  
  
  
void insert(T &d)  
\{  
Node<T> \*p = head;  
while (p->pNode != nullptr)  
\{  
p = p->pNode;  
\}  
Node<T> \*node = new Node<T>(d);  
p->pNode = node;  
\}  
\};  
  
  
int main()  
\{  
Student s1(1000, "Lao xu"), s2(1001, "Liu wa");  
Pet p1("Tom", "MGM"), p2("Jerry", "MGM");  
  
  
**Link<Student> link1;   //代表着T是Student类**  
link1.insert(s1);  
link1.insert(s2);  
link1.display();  
  
  
**Link<Pet> link2;    //代表着T是Pet类**  
link2.insert(p1);  
link2.insert(p2);  
link2.display();  
return 0;  
\}