Pages
▼
Heap Data Structure Complexity
Heap Data Structure Operations
| Data Structure | Time Complexity |
|---|
| Find Max | Extract Max | Increase Key | Insert | Delete | Merge |
|---|
| Binary Heap | O(1) | O(log(n)) | O(log(n)) | O(log(n)) | O(log(n)) | O(m+n) |
| Pairing Heap | O(1) | O(log(n)) | O(log(n)) | O(1) | O(log(n)) | O(1) |
| Binomial Heap | O(1) | O(log(n)) | O(log(n)) | O(1) | O(log(n)) | O(log(n)) |
| Fibonacci Heap | O(1) | O(log(n)) | O(1) | O(1) | O(log(n)) | O(1) |
