数据结构-c++模板的线性表链式存储

测试框架

#include<iostream>  
#include"LinkList_cpp.cpp"
using namespace std;
struct Teacher
{
	char name[64];
	int age;
};
int main()
{
	Teacher t1, t2, t3, t4, t5, tmp;
	t1.age = 21;
	t2.age = 22;
	t3.age = 23;
	t4.age = 24;
	t5.age = 25;
	LinkList_cpp<Teacher> list;
	list.Inster(t1, 0);
	list.Inster(t2, 0);
	list.Inster(t3, 0);
	list.Inster(t4, 0);
	list.Inster(t5, 0);
	for (int i = 0; i < list.Length(); i++)                                                                
	{
		list.Get(tmp, i);
		cout << tmp.age << " ";
	}
	//链表的销毁  
	while (list.Length()>0)
	{
		list.Delete(tmp, 0);
		cout << tmp.age << " ";
	}
	cout << "Hello,,," << endl;
	system("pause");

	return 0;
}

头文件

LinkList_cpp.h

#pragma once
//在插入元素的时候，模板类中，应该把每一个t保存下来
//模板类中应该能非配节点 缓存节点