skipnode.h

来自「一本全面剖析C++数据结构算法的书籍」· C头文件 代码 · 共 18 行

#ifndef SkipNode_
#define SkipNode_

template <class E, class K> class SkipList;

template<class E, class K>
class SkipNode {
   friend SkipList<E,K>;
   private:
      SkipNode(int size)
         {link = new SkipNode<E,K> *[size];}
      ~SkipNode() {delete [] link;}
      E data;
      SkipNode<E,K> **link;  // 1D array of pointers
};

#endif