C++ Data Structures and Algorithms

Refactoring several operations in the LinkedList ADT

Since the Doubly Linked List is similar to Singly Linked List, we can refactor our existing LinkedList ADT to build a new DoublyLinkedList ADT since they have the same available operations but with different implementations. However, the implementation of the Get() and Search() operations is the same for these two ADTs because the traversal process for each element will still move in forwarding, so we won't discuss it anymore. And since DoublyLinkedList can move backwards, we will make a new operation named PrintListBackward() to leverage our DoublyLinkedList data type. To make this clear, here is the declaration of the DoublyLinkedList<T> data type:

template <typename T>class DoublyLinkedList ...