Linear Lists ndash; Linked List Representation课程.pptVIP

* Linear Lists – Linked List Representation CSE, POSTECH * Linked Representation of Linear List Each element is represented in a cell or node. Each node keeps explicit information about the location of other relevant nodes. This explicit information about the location of another node is called a link or pointer. * Singly Linked List Let L = (e1,e2,…,en) Each element ei is represented in a separate node Each node has exactly one link field that is used to locate the next element in the linear list The last node, en, has no node to link to and so its link field is NULL. This structure is also called a chain. e1 e2 e3 en …… first Link Field Data Field 0 * Class ‘ChainNode’ template class T class ChainNode { friend ChainT; private: T data; ChainNodeT *link; }; Since ChainT is a friend of ChainNodeT, ChainT has access to all members (including private members) of ChainNodeT. * Class ‘Chain’ template class T class Chain { public: Chain() { first = 0; } ~Chain(); bool isEmpty() const { return first == 0; } int Length() const; bool Find(int k, T x) const; int Search(const T x) const; ChainT Delete(int k, T x); ChainT Insert(int k, const T x); void Output(ostream out) const; private: ChainNodeT *first; int listSize; }; * Operation ‘~Chain’ template class T ChainT::~Chain() { ChainNodeT *next; while (first) { next = first-link; delete first; first = next; } } The time complexity is Q(n), where n is the length of the chain * Operation ‘Length’ template class T int ChainT::Length() const { ChainNodeT *current = first; int len = 0; while (current) { len++; current = current-link; } return len; } The time complexity is Q(n), where n is the length of the chain * Operation ‘Find’ template class T bool ChainT::Find(int k, T x) const {// Set x to the k’th element in the list if it exists // Throw illegal index exception if no such element exists checkIndex(k); // move to desired node ChainNodeT* current = first