pairnode.h

datastucutre and algorithms, application, in C

// node with a next and element field; element is a pair<const K,E>

#ifndef pairNode_
#define pairNode_

using namespace std;

template <class K, class E>
struct pairNode 
{
   typedef pair<const K, E> pairType;
   pairType element;
   pairNode<K,E> *next;

   pairNode(const pairType& thePair):element(thePair){}
   pairNode(const pairType& thePair, pairNode<K,E>* theNext)
            :element(thePair){next = theNext;}
};

#endif