linked list implementation in c++

template< class T >
	class CTFLink
	{
	public:	

		//--------------------------------------------------------------------------------
		CTFLink()
		{
			m_pNext = 0;
		}

		//--------------------------------------------------------------------------------
		CTFLink( T _t ) : m_Item( _t )
		{
			m_pNext = 0;
		}
		
		//--------------------------------------------------------------------------------
		//A slow but simple append implementation.
		//Appending to any item in the list always appends at the end.
		void Append( CTFLink< T >* ptNext )
		{
			CTFLink< T >* pEnd = this;

			while( pEnd->m_pNext != 0 )
			{
				pEnd = pEnd->m_pNext;
			}

			pEnd->m_pNext = ptNext;
		}

		//--------------------------------------------------------------------------------
		T& Item()
		{
			return m_Item;
		}

		T m_Item;

	protected:

		CTFLink< T >* m_pNext;
		
	};

class CMyThing : public CTFLink< CMyThing >
{
...

#include <iostream>

template <class T>
struct Node
{
  T data;
  Node * next;
};

template <class T>
class LinkedList
{
public:
  LinkedList() : head(NULL), size(0) {};
  ~LinkedList() { destroyList(); };
  bool addNode(T data);
  bool deleteNode(T data);
  Node<T> * searchNode(T data);
  void printList();
  void reverseList();
  void sortList();
private:
  Node<T> * head;
  int size;
  void destroyList();
  Node<T>* mergeSort(Node<T> * head, int total);
  Node<T>* Merge(Node<T>* left, int lcount, Node<T>* right, int rcount);
  void print(Node<T> * tmp);
};

template <class T>
bool LinkedList<T>::addNode(T data)