双向循环链表-C++实现.doc

#ifndef NODE_H #define NODE_H #define NULL 0 class node { friend class LinkList; private: node(int element, node *pre, node *next) { this-m_element = element; this-m_next = next; this-m_pre = pre; } ~node() { } private: int m_element; node *m_next; node *m_pre; }; #endif #ifndef LIN