@@ -199,17 +199,17 @@ Below is the list of some of the most used Big O notations and their performance
199199
200200###Data Structure Operations Complexity
201201
202- | Data Structure| Access| Search| Insertion| Deletion|
203- | -----------------------| :-------:| :-------:| :-------:| :-------:|
204- | ** Array** | 1| n| n| n|
205- | ** Stack** | n| n| 1| 1|
206- | ** Queue** | n| n| 1| 1|
207- | ** Linked List** | n| n| 1| 1|
208- | ** Hash Table** | -| n| n| n|
209- | ** Binary Search Tree** | n| n| n| n|
210- | ** B-Tree** | log(n)| log(n)| log(n)| log(n)|
211- | ** Red-Black Tree** | log(n)| log(n)| log(n)| log(n)|
212- | ** AVL Tree** | log(n)| log(n)| log(n)| log(n)|
202+ | Data Structure| Access| Search| Insertion| Deletion| Comments |
203+ | -----------------------| :-------:| :-------:| :-------:| :-------:| :-------- |
204+ | ** Array** | 1| n| n| n| |
205+ | ** Stack** | n| n| 1| 1| |
206+ | ** Queue** | n| n| 1| 1| |
207+ | ** Linked List** | n| n| 1| 1| |
208+ | ** Hash Table** | -| n| n| n| In case of perfect hash function costs would be O(1) |
209+ | ** Binary Search Tree** | n| n| n| n| |
210+ | ** B-Tree** | log(n)| log(n)| log(n)| log(n)| |
211+ | ** Red-Black Tree** | log(n)| log(n)| log(n)| log(n)| |
212+ | ** AVL Tree** | log(n)| log(n)| log(n)| log(n)| |
213213
214214###Array Sorting Algorithms Complexity
215215