logo

Designing a Double-Ended Linked List

   

Added on  2019-09-30

1 Pages189 Words157 Views
 | 
 | 
 | 
LinkedListDesign1ba0-1-1-1-1DoubleLinkedListClassFirstNodeIndexCurrentNodeIndexgetDisplayString()moveCurrentToPrevious()// do nothing if current or previous index is nullmoveCurrentToNext()// do nothing if current or next index is nullInsert() (all call memory.getAvailableNode() )insertFirstNodeWithEmptyList()insertLastNodeWithPrevious()insertAfterCurrentWithNext()deleteCurrent() (all call memory.deallocateNode()DeleteOnlyNode()DeleteLastNodeWithPrevious()DeleteCurrentWithPreviousAndCurrent()DeleteFirstNodeWithNext()MemoryClassValuePreviousNextFirstAvailableNodeIndexgetAvailableNode()deallocateNode()getDisplayString()
Designing a Double-Ended Linked List_1

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents