Скачать или смотреть Doubly Linked Lists - Design and subclass implementation

Design documentation and implementation of the abstract base class, DoublyLinkedList as well as a review of the implementation of two of its concrete subclasses; Stack and Queue. Use of (virtual … = 0;) to make a method purely virtual and thus require implementation in subclasses.

Table of Contents:

03:22 - Stack Structure
03:54 - Constructor
04:18 - Stack destructor
04:52 - Implementation of add method from base
05:14 - The push method implementation
06:35 - Implementation of the remove method
07:28 - Stacks pop method implementation
08:58 - The Queue class
09:23 - Queue constructor -> base constructor
09:43 - Overridden add method.
09:57 - The enqueue method implementation
10:52 - override/implement the remove method
11:13 - the dequeue method.
13:03 - Abstract base class DoublyLinkedList