Update LinkedList time complexity for deletion.

trekhleb · trekhleb · commit 2371dd28d324 · 2019-03-08T13:13:21.000+02:00
diff --git a/README.md b/README.md
@@ -279,7 +279,7 @@ Below is the list of some of the most used Big O notations and their performance
 | **Array** | 1 | n | n | n | |
 | **Stack** | n | n | 1 | 1 | |
 | **Queue** | n | n | 1 | 1 | |
-| **Linked List** | n | n | 1 | 1 | |
+| **Linked List** | n | n | 1 | n | |
 | **Hash Table** | - | n | n | n | In case of perfect hash function costs would be O(1) |
 | **Binary Search Tree** | n | n | n | n | In case of balanced tree costs would be O(log(n)) |
 | **B-Tree** | log(n) | log(n) | log(n) | log(n) | |

-Original file line number
+Diff line change
 |**Array**| 1 | n | n | n ||
 |**Stack**| n | n | 1 | 1 ||
 |**Queue**| n | n | 1 | 1 ||
 -|**Linked List**| n | n | 1 |1||
 +|**Linked List**| n | n | 1 |n||
 |**Hash Table**| - | n | n | n | In case of perfect hash function costs would be O(1) |
 |**Binary Search Tree**| n | n | n | n | In case of balanced tree costs would be O(log(n)) |
 |**B-Tree**| log(n) | log(n) | log(n) | log(n) ||