I was studying binomial heaps and its time analysis. Are there any inputs that cause DELETE-MIN, DECREASE-KEY, and DELETE to run in $\Omega(\log n)$ time for a binomial heap rather than $O(\log n)$?
Input that causes an operation on a binomial heap to run in $\Omega(\log n)$ time?
algorithms;data structures;lower bounds;heaps