Search data structure: Difference between revisions

Content deleted Content added
Constant-time deletes are wrong for linked lists, inserts are logN for BSTs and Heap, other incorrect timings
Line 63:
| Unsorted [[linked list]]
| O(1)
| O(1''n'')
| N/A
| O(''n'')
Line 72:
|-
| Sorted linked list
| O(1''n'')
| O(1''n'')
| N/A
| O(''n'')
Line 82:
|-
| [[Self-balancing binary tree]]
| O(1log ''n'')
| O(1log ''n'')
| O(log ''n'')
| N/A
Line 92:
|-
| [[Heap (data structure)|Heap]]
| O(1log ''n'')
| O(1log ''n'')
| O(log ''n'')
| N/A