priority queues (heaps figure result of applying deletemin to implementation of binomial queues the deletemin operation requires the ability to find all the subtrees of the root quicklyso the standard representation of general trees is requiredthe children of each node are kept in linked listand each node has pointer to its first child (if anythis operation also requires that the children be ordered by the size of their subtrees we also need to make sure that it is easy to merge two trees when two trees are mergedone of the trees is added as child to the other since this new tree will be the largest subtreeit makes sense to maintain the subtrees in decreasing sizes only then will we be able to merge two binomial treesand thus two binomial queuesefficiently the binomial queue will be an array of binomial trees to summarizetheneach node in binomial tree will contain the datafirst childand right sibling the children in binomial tree are arranged in decreasing rank figure shows how the binomial queue in figure is represented figure shows the type declarations for node in the binomial tree and the binomial queue class interface figure binomial queue drawn as forest figure representation of binomial queue