java-doubly-linked-list

Implement common methods for Doubly Linked Lists, including:

• void push (node): This method will add a new node to the end of the list.
• void printValuesForward(): This method prints the values of the nodes from the head to the tail.
• void printValuesBackward(): This method prints the values of the nodes from the tail to the head.
• Node pop(): This method removes the last node of our DLL and returns it.
• boolean contains(Integer value): This method returns a boolean whether the value in the argument is in the list or not. Return true if the value exists, else, return false.
• int size(): Returns the number of nodes in the list.