This paper introduces a highly efficient double-ended heap structure called d-b-queues, which are an extension of binomial queues. D-b-queues achieve the following amortized time bounds: O(1) for findmin, findmax, insert, and merge operations, and O(logn) for deletemin, deletemax, decreasekey, increasekey, arbitrary delete, and split operations. An n-node d-b-queue can be constructed in 1.75n comparisons. Our results include a simple proof of O(1) amortized time merging for ordinary binomial queues.