Linked Lists/Java/Circular: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 14: | Line 14: | ||
=Flags= | =Flags= | ||
{{ | {{LinkedListFlag}} | ||
[[Category:Linked Lists]] | [[Category:Linked Lists]] | ||
[[Category:Java]] | [[Category:Java]] | ||
[[Category:Circular Linked Lists]] | [[Category:Circular Linked Lists]] | ||
Revision as of 17:04, 9 September 2017
Circular linked lists can be implemented with either a single or a doubly linked list.
For an instance of a singly-linked circular linked list, see linked list implementations in the git.charlesreid1.com Java cs repo:
Specifically, the CLinkedList class implements a circularly linked list that is expandable but that conserves space.
For an example of a doubly-linked circular list, see the LinkedDeque implementation:
- Wiki notes: StacksQueues/Java/LinkedDeque
- Git: https://charlesreid1.com:3000/cs/java/src/master/stacks-queues-deques/queues/LinkedDeque.java
Flags
 |
Linked List Part of Computer Science Notes
Series on Data Structures Java: Linked Lists/Java · Linked Lists/Java/Single · Linked Lists/Java/Double · Linked Lists/Java/Circular Performance: Linked Lists/Java/Timing · Linked Lists/Java/Reverse Python: Linked Lists/Python · Linked Lists/Python/Single
|