Data Structures Flashcards
1
Q
Stack Insertion
A
Average: O(1)
Worst: O(1)
2
Q
Array Space Complexity
A
O(n)
3
Q
Binary Search Tree
Deletion
A
Average: O(log n)
Worst: O(n)
4
Q
Queue Deletion
A
Average: O(1)
Worst: O(1)
5
Q
Stack Space Complexity
A
O(n)
6
Q
Array Access
A
Average: O(1)
Worst: O(1)
7
Q
Array Deletion
A
Average: O(n)
Worst: O(n)
8
Q
Stack Search
A
Average: O(n)
Worst: O(n)
9
Q
Queue Space Complexity
A
O(n)
10
Q
Array Insert
A
Average: O(n)
Worst: O(n)
11
Q
Queue Search
A
Average: O(n)
Worst: O(n)
12
Q
Stack Access
A
Average: O(n)
Worst: O(n)
13
Q
Array Search
A
Average: O(n)
Worst: O(n)
14
Q
Binary Search Tree
Insertion
A
Average: O(log n)
Worst: O(n)
15
Q
Linked List Space Complexity
A
O(n)
