logo

LinkedListDesign.

   

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()

End of preview

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

Related Documents
Interview Questions
|7
|1175
|91

Implementation of Linked List
|5
|1119
|220

Data Structure - Assignment
|9
|1398
|163

Q1. Algorithm for Insertion Sort Ans. 1. Start from all
|2
|394
|25

Q1. Algorithm for Insertion Sort Ans. 1. Start from all
|2
|394
|68

Programming Assignment - Public Class Int List
|6
|2157
|149