Data Structures Flashcards
Stack Insertion
Average: O(1)
Worst: O(1)
Array Space Complexity
O(n)
Binary Search Tree
Deletion
Average: O(log n)
Worst: O(n)
Queue Deletion
Average: O(1)
Worst: O(1)
Stack Space Complexity
O(n)
Array Access
Average: O(1)
Worst: O(1)
Array Deletion
Average: O(n)
Worst: O(n)
Stack Search
Average: O(n)
Worst: O(n)
Queue Space Complexity
O(n)
Array Insert
Average: O(n)
Worst: O(n)
Queue Search
Average: O(n)
Worst: O(n)
Stack Access
Average: O(n)
Worst: O(n)
Array Search
Average: O(n)
Worst: O(n)
Binary Search Tree
Insertion
Average: O(log n)
Worst: O(n)
Linked List Space Complexity
O(n)
Linked List Access
Average: O(n)
Worst: O(n)
Linked List Search
Average: O(n)
Worst: O(n)
Stack Deletion
Average: O(1)
Worst: O(1)
Queue Access
Average: O(n)
Worst: O(n)
Linked List Deletion
Average: O(1)
Worst: O(1)
Queue Insertion
Average: O(1)
Worst: O(1)
Binary Search Tree
Search
Average: O(log n)
Worst: O(n)
Linked List Insertion
Average: O(1)
Worst: O(1)
Binary Search Tree
Space Complexity
O(n)
Binary Search Tree
Access
Average: O(log n)
Worst: O(n)
