From 2a3b013bfa33b71ee02f927021bb5e401f467387 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Fri, 25 May 2018 07:35:52 +0300 Subject: [PATCH] Add data-structure complexity table. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d6757be8..630097c7 100644 --- a/README.md +++ b/README.md @@ -206,7 +206,7 @@ Below is the list of some of the most used Big O notations and their performance | **Queue** | n | n | 1 | 1 | | | **Linked List** | n | n | 1 | 1 | | | **Hash Table** | - | n | n | n | In case of perfect hash function costs would be O(1) | -| **Binary Search Tree** | n | n | n | n | | +| **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) | | | **Red-Black Tree** | log(n) | log(n) | log(n) | log(n) | | | **AVL Tree** | log(n) | log(n) | log(n) | log(n) | |