From 2371dd28d32419d513c86099b0820bd699b55d42 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Fri, 8 Mar 2019 13:13:21 +0200 Subject: [PATCH] Update LinkedList time complexity for deletion. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 1ee08d8e..151ebde3 100644 --- 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) | |