// LinkNode.h Wed Feb 12 17:06:42 PST 2003 class LinkNode{ public: LinkNode(int); // initializes item field to parameter, next to 0 int item; // the value stored in the node LinkNode * next; // pointer to the next node, 0 if this is the last node void merge(LinkNode * ); // input condition: both lists are sorted void sortList(int); // uses mergesort parameter is length of list ~LinkNode(); // recursively deletes all nodes in the list static int compCount; // the number of comparisons so far };