aboutsummaryrefslogtreecommitdiffstats
path: root/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java6
1 files changed, 5 insertions, 1 deletions
diff --git a/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java b/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
index dc4453f..22cd43a 100644
--- a/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
+++ b/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
@@ -22,7 +22,11 @@ package datastructures.linkedlists;
* linked list is a linked list constructed by parallel
* arrays. In this implementation, when a node is
* removed the value stored that that position is not
- * removed before that position is reused.
+ * removed before that position is reused. Insertion
+ * methods have constant amortised time complexity,
+ * and constant amortised memory complexity, removal
+ * methods have constant time complexity and constant
+ * memory complexity.
*
* @param <T> The value stored in the structure
*/