studlist.h

双向连表的演示程序 1、创建连表 2、在头部增加节点 3、在尾部增加节点 4、插入节点 5、删除节点 6、遍历连表

// StuDList.h: interface for the CStuDList class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_STUDLIST_H__50799D0A_D6E2_4317_B8DE_88A6C88C3E7A__INCLUDED_)
#define AFX_STUDLIST_H__50799D0A_D6E2_4317_B8DE_88A6C88C3E7A__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include "Stu.h"
class CStuDList  
{
public:
	CStuDList();
	virtual ~CStuDList();
// Attribute
	CStu*  m_pFirstNode;
	CStu*  m_pLastNode;
	CStu*  m_pCurNode;
// Operations
	void  AddTailNode(CStu* pStu);
	void  AddHeadNode(CStu* pStu);
	void  CreateDList(CStu* pStu);
	void  InsertNode(CStu* pStu);
	void  DelCurNode();
	CStu* GetNextNode();
	CStu* GetPreNode();
};

#endif // !defined(AFX_STUDLIST_H__50799D0A_D6E2_4317_B8DE_88A6C88C3E7A__INCLUDED_)