顺序链表 不带头结点 c++

#include <iostream>
using namespace std;

class LinkList	;

class Node {
	friend class LinkList ;
	private :
		int data;
		Node * next;
};

class LinkList	{
	private :
		Node *	head;
	public:
		LinkList()	{
			head = 0;
		}
		~LinkList()	{
			Node *p;
			while (head)	{
				p = head->next;
				delete head;
				head =p;
			}
		}
		bool IsEmpty()	const	{
			if (head)
				return false;
			else 
				return true;
		}

		int Length()const {
			int i= 0;
			Node *p =head;
			while (p)	{
					i++;
					p = p->next;
			}
			return i;
		}
		int Find(const int &elem)	const{
			int i =0;
			Node* p = head;
			while ( p )	{
				i++;
				if (p->data  == elem)
					return i;
			}
			return 0;
		}

		bool GetElem( int pos, int &m)	const	{
			int i = 1;
			Node * p =head;
			while (p && i< pos)	{
				i++;
				p= p->next;
			}
			if( !p ||  i>pos)	{
				cout&