Table:
text: Heap (data structure)
Comparison of theoretic bounds for variants
Comparison of theoretic bounds for variants
Operation_ Binary_ Binomial Fibonacci Pairing Brodal_ Strict_Fibonacci_Heap
find-min Θ(1) Θ(1) Θ(1) Θ(1) Θ(1) Θ(1)
delete-min Θ(log n) Θ(log n) O(log n)* O(log n)* O(log n) O(log n)
insert Θ(log n) O(log n) Θ(1) Θ(1) Θ(1) Θ(1)
decrease-key Θ(log n) Θ(log n) Θ(1)* O(log n)* Θ(1) Θ(1)
merge Θ(n) O(log n)** Θ(1) Θ(1) Θ(1) Θ(1)

Question: What is the binomial of θ(log n), and a strict Fibonacci heap of o(log n) is the operation for heap (data structure)?

Question: The operation of find-min has what Fibonacci under heap (data structure)?

Question: In the heap data structure, the binomial of θ(1) has which pairing?

Question: The pairing of θ(1) and a binomial of θ(1) is which binary number considering heap (data structure)?

Question: Which operation of find-min has which binary under heap (data structure)?

Question: Which binomial is the Fibonacci of θ(1) and the binary of θ(log n) in heap (data structure)?