#ifndef LINKEDLIST
#define LINKEDLIST
#include<iostream.h>

template<typename DataType>
class LinkedList
{
	private:
		class Node
		{
		public:          // Makes it accessible (public) by class Node
			DataType data;
			Node *next;
		};

		Node *first;
		int mySize;

		LinkedList::deleteLL()
		{
			Node *tempP=first, *disposeP;
			while (tempP!=0)
			{
				disposeP=tempP;
				tempP=tempP->next;
				delete disposeP;
			}
			return;
		}

		Node* LinkedList::copyLL(Node* source)
		{
			if (source==0)
				return 0;
			Node* newH=new Node;
			Node *tempP=newH;
			newH->data=source->data;
			source=source->next;
			while (source!=0)
			{
				tempP->next=newNode;
				tempP->data=source->data
					tempP=tempP->next;
				source=source->next;
			}
			temp->next=0;
			return newH;
		}

		public:
			LinkedList::LinkedList()
			{
				mySize=0;
				first=0;
			}
			LinkedList::~LinkedList()
			{
				deleteLL();
			}

			LinkedList::LinkedList( const LinkedList &source)
			{
				mySize=source.first;
				first=copyLL(source.first);
			}

			LinkedList& LinkedList::operator=(const LinkedList& s)
			{
				if (this!=&s)
				{
					deleteLL();
					mySize=s.mySize;
					first=copyLL(s.first)
				}
				return *this;
			}
				bool LinkedList::empty()
				{
					return (first==0);
				}
				void LinkedList::insert(DataType item, unsigned pos)
				{
					if (pos>mySize+1)
					{
						cout<<"Illegal position to insert:"<<pos<<endl;
						return;
					}
					mySize++
						Node* newNode=newNode;
					newNode->data=item;
					Node* prev=first;
					for (int i=1, i<pos, i++)
						prev=prev->next;
					newNode->next=prev->next;
					prev->next=newNode;
				}
				void LinkedList::delete (dataType item)
				{
					mySize--;
					Node* tempP=first;
					Node* prev=0;
					while (tempP!=0 && tempP->data!=item)
					{
						prev=tempP;
						tempP=tempP->next;
					}
					if (tempP!=0 && tempP->data==item)
					{
						prev->next=tempP->next;
						delete tempP;
					}
						else
							cout<<"Item to delete not found"<<endl;
						return;
				}

				int LinkedList::locate(DataType item)
				{
					int position=0;
					Node* ptr=first;
					while(ptr->data<item &&ptr!=0)
					{
						position++;
						ptr=ptr->next;
					}
					return position
				}

						void LinkedList::traverse()
						{
							Node *temp=first;
							while (tempP!=0)
							{
								Process(tempP->data);
								tempP=tempP->next;
							}
							return;
						}
				};
#endif