listnode.h

数据结构答案 金元平

// ListNode.h: interface for the ListNode class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_LISTNODE_H__1D05A1FD_B9FE_44F2_AA9E_018B6C7A7548__INCLUDED_)
#define AFX_LISTNODE_H__1D05A1FD_B9FE_44F2_AA9E_018B6C7A7548__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

template <class T> class CircList;
template <class T> class CircListIterator;

template <class T>
class ListNode
{
	friend class CircList<T>;
	friend class CircListIterator<T>;
	
public:
	ListNode();
	ListNode(const T& d);
	virtual ~ListNode();

private:
	T data;
	ListNode<T>* link;

};

template <class T>
ListNode<T>::ListNode()
{
	
}

template <class T>
ListNode<T>::ListNode(const T& d)
:data(d)
{
}

template <class T>
ListNode<T>::~ListNode()
{

}

#endif // !defined(AFX_LISTNODE_H__1D05A1FD_B9FE_44F2_AA9E_018B6C7A7548__INCLUDED_)