Linked Lists/Java/Circular: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
For an instance of a singly-linked circular linked list, see linked list implementations in the git.charlesreid1.com Java cs repo: | For an instance of a singly-linked circular linked list, see linked list implementations in the git.charlesreid1.com Java cs repo: | ||
* https://charlesreid1.com | * https://git.charlesreid1.com/cs/java/src/master/lists/linked-lists | ||
* Wiki notes: [[Linked Lists/Java]] | * Wiki notes: [[Linked Lists/Java]] | ||
| Line 9: | Line 9: | ||
For an example of a doubly-linked circular list, see the LinkedDeque implementation: | For an example of a doubly-linked circular list, see the LinkedDeque implementation: | ||
* Wiki notes: [[StacksQueues/Java/LinkedDeque]] | * Wiki notes: [[StacksQueues/Java/LinkedDeque]] | ||
* Git: https://charlesreid1.com | * Git: https://git.charlesreid1.com/cs/java/src/master/stacks-queues-deques/queues/LinkedDeque.java | ||
Latest revision as of 00:07, 17 March 2019
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://git.charlesreid1.com/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
|