Time Complexities Flashcards
1
Q
Array - Access
A
O(1)
2
Q
Array - Search
A
O(n)
3
Q
Array - Insertion
A
O(n)
4
Q
Array - Deletion
A
O(n)
5
Q
Stack - Access
A
O(n)
6
Q
Stack - Search
A
O(n)
7
Q
Stack - Insertion
A
O(1)
8
Q
Stack - Deletion
A
O(1)
9
Q
Queue - Access
A
O(n)
10
Q
Queue - Search
A
O(n)
11
Q
Queue - Insertion
A
O(1)
12
Q
Queue - Deletion
A
O(1)
13
Q
Singly Linked List - Access
A
O(n)
14
Q
Singly Linked List - Search
A
O(n)
15
Q
Singly Linked List - Insertion
A
O(1)
16
Q
Singly Linked List - Deletion
A
O(1)
17
Q
Doubly Linked List - Access
A
O(n)
18
Q
Doubly Linked List - Search
A
O(n)
19
Q
Doubly Linked List - Insertion
A
O(1)
20
Q
Doubly Linked List - Deletion
A
O(1)
21
Q
Hash Table - Access
A
Best Case with perfect hashing: O(1)
Worst Case: O(n)
22
Q
Hash Table - Search
A
O(1)
23
Q
Hash Table - Insertion
A
O(1)
24
Q
Hash Table - Deletion
A
O(1)
25
Binary Search Tree - Access
O(log(n))
26
Binary Search Tree - Search
O(log(n))
27
Binary Search Tree - Insertion
O(log(n))
28
Binary Search Tree - Deletion
O(log(n))
