数据结构与算法分析（C语言 英文版）教学课04 Lists, Stacks, and Queues.pptVIP

* // Return top element bool topValue(Elem it) const { if (top == 0) return false; else { it = listArray[top-1]; return true; } } int length() const { return top; } }; Array-Based Stack (5) top listArray size it * 2. Stacks 2.1 Definition of Stacks 2.2 ADT of Stacks 2.3 Basic Implementation of Stacks 2.3.1 Array-based Stack 2.3.2 Linked Stack 2.4 Application of stacks * Linked Stack (1) // Linked stack implementation template class Elem class LStack: public StackElem { private: LinkElem* top; // Pointer to first elem int size; // Count number of elems top * public: LStack(int sz =DefaultListSize) { top = NULL; size = 0;} Linked Stack (2) top size = 0 Stack is empty After push 1 element NULL top size = 1 After push 2 elements top size = 2 * Insert // Insert at front of right partition template class Elem bool LListElem::insert(const Elem item) { fence-next = new LinkElem(item, fence-next); if (tail == fence) tail = fence-next; rightcnt++; return true;} head tail fence item ?(1) * Append // Append Elem to end of the list template class Elem bool LListElem::append(const Elem item) { tail = tail-next = new LinkElem(item, NULL); rightcnt++; return true;} head tail fence item * Remove * Remove // Remove and return first Elem in right // partition template class Elem bool LListElem::remove(Elem it) { if (fence-next == NULL) return false; it = fence-next-element; // Remember val // Remember link node LinkElem* ltemp = fence-next; fence-next = ltemp-next; // Remove delete ltemp; // Reclaim space rightcnt--; return true; } head tail fence ltemp * Remove // Remove and return first Elem in right // partition template class Elem bool LListElem::remove(Elem it) { if (fence-next == NULL) return false; it = fence-next-element; // Remember val // Remember link node LinkElem* ltemp = fence-next; fence-next = ltemp-next; // Remove if (tail == ltemp) // Reset tail tail = fence;