Now, consider a d$-$heap. This tree has the property that the parent's value is smaller than or equal to the value of any of its children. Assume the tree has n$-$elements.

A$.$ the d$-$heap might degenerate after a series of deletemin operations

B$.$ the largest element in a d$-$heap can be found in O$($log d N$)$ in worst case

C$.$ the d$-$heap might degenerate after a series of insert operations

D$.$ Printing the kth smallest element O$($N $^$ k$)$

E$.$ Printing the N$/2$ elements in order costs O$($N $^2)$

F$.$ The largest element must be one of the leaf nodes