template<class Data>
struct LISTNODE
{
	Data data;
	LISTNODE<Data>* pPrev;
	LISTNODE<Data>* pNext;
};

template<class Data>
class CLinkedList  
{
public:
	CLinkedList()
	{
		m_pList = NULL;
		m_pFirst = NULL;
		m_pLast = NULL;

		m_numRecords = 0;
	}

	virtual ~CLinkedList()
	{
		LISTNODE<Data>* tempNode = NULL;

		m_pList = m_pFirst;

		do
		{
			if (m_pList)
			{
				tempNode = m_pList->pNext;
				delete m_pList;
			}
			m_pList = tempNode;
		} while (tempNode);
	}

	void AddItem(const Data& data)
	{
		if (!m_pFirst) // if this is the first node

		{
			m_pList = new LISTNODE<Data>; // make the first node

			m_pFirst = m_pLast = m_pList; // set all of the pointers

			m_pList->pNext = m_pList->pPrev = NULL; // Ditto

			m_pList->data = data;
		}
		else
		{
			LISTNODE<Data>* tempNode;

			tempNode = m_pLast;
			m_pLast->pNext = new LISTNODE<Data>;
			m_pLast = m_pLast->pNext;
			m_pLast->data = data;
			m_pLast->pPrev = tempNode;
			m_pLast->pNext = NULL;
			tempNode->pNext = m_pLast;
		}
		m_numRecords++;
	}

	Data operator[](int index)
	{
		LISTNODE<Data>* tempNode;
		int i;

		if (index < 0 || index > m_numRecords - 1)
			return NULL;

		tempNode = m_pList = m_pFirst;

		for (i = 0; i < index; i++)
		{
			tempNode = tempNode->pNext;		
		}

		return tempNode->data;
	}
private:
	LISTNODE<Data>* m_pList;
	LISTNODE<Data>* m_pFirst;
	LISTNODE<Data>* m_pLast;

	int m_numRecords;
};
  

              CLinkedList<int>;CLinkedList<float>;CLinkedList<CLinkedList<int>>; // linked list of linked lists!// etc....