binomialnode *oldroot thetreesminindex ]binomialnode *deletedtree oldroot->leftchilddelete oldroot/construct 'binomialqueue deletedqueuedeletedqueue thetrees resizeminindex )deletedqueue currentsize <minindex forint minindex > -- deletedqueue thetreesj deletedtreedeletedtree deletedtree->nextsiblingdeletedqueue thetreesj ]->nextsibling nullptr/construct hthetreesminindex nullptrcurrentsize -deletedqueue currentsize mergedeletedqueue )/*find index of tree containing the smallest item in the priority queue the priority queue must not be empty return the index of tree containing the smallest item *int findminindexconst int iint minindexfori thetreesi =nullptr++ forminindex ii thetrees size)++ ifthetreesi !nullptr &thetreesi ]->element element minindex ireturn minindexfigure (continued