| Worst Case Scenario | Average Case Scenario | Best Case Scenario | |
|---|---|---|---|
| Updating an element | O(n) | O(1) | O(1) |
| Inserting an element | O(n) | O(1) | O(1) |
| Deleting an element | O(n) | O(1) | O(1) |
| Searching for an element | O(n) | O(1) | O(1) |
| Insert (TreeMap) | O(log n) | O(log n) | O(1) |
| Delete (TreeMap) | O(log n) | O(log n) | O(1) |
| Search (TreeMap) | O(log n) | O(log n) | O(1) |
Learn more about Code Complexity
Leave a Reply