template<class T>
bool List<T>::Insert(int i,T&x){
LinkNode<T> *current= Locate(i); //locate()函数是定位函数 上一篇写了
if(current ==NULL) return false;
LinkNode<T> *newNode = new LinkNode<T>(x);
if(newNode==NULL)
{
cout<<"内存分配错误"<<endl;
exit(1);
}
newNode->link = current->link;
current->link= newNode;
return true;
}