I need help with the following Java code

Use a two-part circular linked chain to implement the ADT deque. Name your class TwoPartCircularLinkedDeque. In this implementation each of your nodes will consist of three data fields, namely, previous (of type Node), data (of type T), and next (of type Node).

Here is the interface the class needs to implement

/** An interface for the ADT deque. @author Frank M. Carrano @author Timothy M. Henry @version 4.0 */ public interface DequeInterface { /** Adds a new entry to the front/back of this deque. @param newEntry An object to be added. */ public void addToFront(T newEntry); public void addToBack(T newEntry); /** Removes and returns the front/back entry of this deque. @return The object at the front/back of the deque. @throws EmptyQueueException if the deque is empty before the operation. */ public T removeFront(); public T removeBack(); /** Retrieves the front/back entry of this deque. @return The object at the front/back of the deque. @throws EmptyQueueException if the deque is empty. */ public T getFront(); public T getBack(); /** Detects whether this deque is empty. @return True if the deque is empty, or false otherwise. */ public boolean isEmpty(); /* Removes all entries from this deque. */ public void clear(); } // end DequeInterface