Objective

Demonstrate an understanding of:

Containers and Abstract Data Types

Linked List Concepts

Specification

You will develop a Doubly$-$Linked List class based on the concepts that you have learned about linked lists. Do not inherit from the Linked List class, but feel free to duplicate any code from that class.

Start with a DLLNode class, similar to the Node class. The DLLNode class should have a self.prev attribute in addition to the attributes that a linked list node has.

Now let's work on the DoublyLinkedList class. First off, you will need to add a protected $\_$tail attribute. Your code should implement the following public methods in a class called DoublyLinkedList. Some of these will identical to the LinkedList code. Others are trivially different. Still others require quite a bit of thought to implement the self.prev attribute.

The new methods should behave in the same way that the LinkedList methods behaved. For example, remove$\_$after$\_$current$()$ should return data.

add$\_$to$\_$head$($data$)$

self.$\_$curr should reset to head after this action

add$\_$after$\_$current$($data$)$

remove$\_$from$\_$head$($data$)$

self.$\_$curr should reset to head after this action

remove$\_$after$\_$current$()$

reset$\_$to$\_$head$()$

reset$\_$to$\_$tail$()$

move$\_$forward$()$

move$\_$backward$()$

find$($data$)$

remove$($data$)$

self.$\_$curr should reset to head after this action