aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <maandree@operamail.com>2014-01-22 12:05:42 +0100
committerMattias Andrée <maandree@operamail.com>2014-01-22 12:05:42 +0100
commit50426f1c2c20b10bec70ba4cf9980ffb5d5be9a7 (patch)
tree6b48f929ae7a755aaa67a6f68fef6be6433d9415
parentadd tailless doubly linked list (diff)
downloadalgorithms-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>
-rw-r--r--src/datastructures/linkedlists/DoublyLinkedList.java2
-rw-r--r--src/datastructures/linkedlists/SinglyLinkedList.java2
-rw-r--r--src/datastructures/linkedlists/TaillessDoublyLinkedList.java2
-rw-r--r--src/datastructures/linkedlists/TaillessSinglyLinkedList.java2
4 files changed, 4 insertions, 4 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
diff --git a/src/datastructures/linkedlists/SinglyLinkedList.java b/src/datastructures/linkedlists/SinglyLinkedList.java
index b0bfc51..6633941 100644
--- a/src/datastructures/linkedlists/SinglyLinkedList.java
+++ b/src/datastructures/linkedlists/SinglyLinkedList.java
@@ -26,7 +26,7 @@ package datastructures.linkedlists;
* singly linked list only stores nodes with
* references to the following node. It also stores
* two refence nodes, the first node in the list,
- * and the last node in the list. The implemention
+ * 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 implemented
diff --git a/src/datastructures/linkedlists/TaillessDoublyLinkedList.java b/src/datastructures/linkedlists/TaillessDoublyLinkedList.java
index bcc680c..0304ea9 100644
--- a/src/datastructures/linkedlists/TaillessDoublyLinkedList.java
+++ b/src/datastructures/linkedlists/TaillessDoublyLinkedList.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 one refence nodes, the first node
- * in the list. The implemention only implements
+ * 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 * implemented — time complexity
diff --git a/src/datastructures/linkedlists/TaillessSinglyLinkedList.java b/src/datastructures/linkedlists/TaillessSinglyLinkedList.java
index 6de16b8..aecd612 100644
--- a/src/datastructures/linkedlists/TaillessSinglyLinkedList.java
+++ b/src/datastructures/linkedlists/TaillessSinglyLinkedList.java
@@ -26,7 +26,7 @@ package datastructures.linkedlists;
* languages. A singly linked list only stores nodes
* with references to the following node. It also
* stores one refence nodes, the first node in the
- * list. The implemention only implements methods
+ * list. This implemention only implements methods
* that do not require iterating over all nodes for
* find a specific; all other methods' — those that
* are implemented — time complexity is Θ(1).