diff options
| author | Mattias Andrée <maandree@operamail.com> | 2014-01-22 12:05:42 +0100 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2014-01-22 12:05:42 +0100 |
| commit | 50426f1c2c20b10bec70ba4cf9980ffb5d5be9a7 (patch) | |
| tree | 6b48f929ae7a755aaa67a6f68fef6be6433d9415 /src/datastructures/linkedlists/DoublyLinkedList.java | |
| parent | add tailless doubly linked list (diff) | |
| download | algorithms-and-data-structures-50426f1c2c20b10bec70ba4cf9980ffb5d5be9a7.tar.gz algorithms-and-data-structures-50426f1c2c20b10bec70ba4cf9980ffb5d5be9a7.tar.bz2 algorithms-and-data-structures-50426f1c2c20b10bec70ba4cf9980ffb5d5be9a7.tar.xz | |
m doc
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to '')
| -rw-r--r-- | src/datastructures/linkedlists/DoublyLinkedList.java | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/datastructures/linkedlists/DoublyLinkedList.java b/src/datastructures/linkedlists/DoublyLinkedList.java index 334eee5..7bb091d 100644 --- a/src/datastructures/linkedlists/DoublyLinkedList.java +++ b/src/datastructures/linkedlists/DoublyLinkedList.java @@ -26,7 +26,7 @@ package datastructures.linkedlists; * doublely linked list stores nodes with references * to both the following node and the previous node. * It also stores two refence nodes, the first node - * in the list, and the last node in the list. The + * in the list, and the last node in the list. This * implemention only implements methods that do not * require iterating over all nodes for find a * specific; all other methods' — those that are |