User talk:Deviprasad2255

using namespace std; template class node {	public:t data; node * next; node {	data=0; next=NULL; } }; template class linkedlist { node*first; public:linkedlist { first=NULL; } void insertion(t); /*void printlist; void remove; void successor(t); void predecessor(t);*/ }; template void linkedlist::insertion (t data) { node*ptr,*lptr; if(first==NULL) {	 ptr=new node; first=ptr; ptr->data=data; ptr->next=NULL; }	else {	 ptr=first; while(ptr!=NULL) {		lptr=ptr; ptr=ptr->next; }	ptr=new node; ptr->data=data; ptr->next=NULL; lptr->next=ptr; }	cout<<"inserted"<>ch; switch(ch) {		case 1:cout<<"enter the element"; cin>>data; list.insertion(data); break; /*case 2:cout<<"enter the element" cin>>data; list.find(data); break; case 3:list.printlist; break; case 4:cout<<"enter the index\n"; cin>>data; list.remove(data); break; case 5:cout<<"enter the element"; cin>>data; break; case 6:cout<<"enter an element"; cin>>data; list.successor(data); break;*/ case 7:exit(0); break; }	} }
 * 1) include
 * 2) include