Content deleted Content added
Dalton Quinn (talk | contribs) Added balancing speed to the table to distinguish between data structures that would otherwise appear similar. |
Dalton Quinn (talk | contribs) →Asymptotic amortized worst-case analysis: Trees don't always require balancing, so making this O(1), added Tries to the list. |
||
Line 45:
| O(''n'')
| N/A
|
| O(''n'')
| O(''n'')
Line 54:
| O(''n'')
| O(''n'')
| N/A
| O(''n'')▼
| O(1)
| O(log ''n'')
Line 74:
| O(1)
| O(1)
| N/A
| O(''n'')▼
| O(''n'')
| O(''n'')
Line 82:
|-
| [[Self-balancing binary tree]]
| O(
| O(
| O(log ''n'')
| N/A
Line 92:
|-
| [[Heap (data structure)|Heap]]
| O(
| O(
| O(log ''n'')
| N/A
Line 110:
| O(''n'')
| O(''n'')
|-
[ [[Trie]]
| O(''m'')
| N/A
| N/A
| O(''m'')
| O(''m'')
| O(''m'')
▲| O(''n'')
|}
| |||