Time Complexities Flashcards
Array - Access
O(1)
Array - Search
O(n)
Array - Insertion
O(n)
Array - Deletion
O(n)
Stack - Access
O(n)
Stack - Search
O(n)
Stack - Insertion
O(1)
Stack - Deletion
O(1)
Queue - Access
O(n)
Queue - Search
O(n)
Queue - Insertion
O(1)
Queue - Deletion
O(1)
Singly Linked List - Access
O(n)
Singly Linked List - Search
O(n)
Singly Linked List - Insertion
O(1)
Singly Linked List - Deletion
O(1)
Doubly Linked List - Access
O(n)
Doubly Linked List - Search
O(n)
Doubly Linked List - Insertion
O(1)
Doubly Linked List - Deletion
O(1)
Hash Table - Access
Best Case with perfect hashing: O(1)
Worst Case: O(n)
Hash Table - Search
O(1)
Hash Table - Insertion
O(1)
Hash Table - Deletion
O(1)
Binary Search Tree - Access
O(log(n))
Binary Search Tree - Search
O(log(n))
Binary Search Tree - Insertion
O(log(n))
Binary Search Tree - Deletion
O(log(n))
