none 

Statements about this table:
the delete - min operation include a binomial of 0 (log n) and a strict fibonacci heap of o (log n)
the operation of find - min have a strict fibonacci heap of 0 (1)
in the find - min operation , the binary , pair and binomial classification all have a Θ (1)
in decrease - key operation , the binary be θ (log n) , fibonacci be θ (1) and binomial be o (log n)
the binomial Θ (log n) have a pairing of θ (1)
θ (1) be the binary , binomial , and pair for merge
o (log n) be the binary and binomial of decrease - key
the binomial be o (log n) of operation find - min
operation
binary
binomial
fibonacci
find - min
θ (1)
θ (1)
θ (1)
delete - min
θ (log n)
θ (log n)
o (log n)
insert
θ (log n)
o (log n)
θ (1)
decrease - key
θ (log n)
θ (log n)
θ (1)
merge
θ (n)
o (log n)
θ (1)
operation
pairing
brodal
strict fibonacci heap
find - min
θ (1)
θ (1)
θ (1)
delete - min
o (log n)
o (log n)
o (log n)
insert
θ (1)
θ (1)
θ (1)
decrease - key
o (log n)
θ (1)
θ (1)
merge
θ (1)
θ (1)
θ (1)