Munro and Suwanda advocate using a bi-parental one in some cases, allowing for square root n search times. Their "soft" variety introduces "corruptions" to increase operation speed. Crane introduced one that uses an S-value and is unbalanced, the "leftist" type. Better amortized runtime than allowed by binomial ones is achieved by lazy evaluation made possible in a specially defined forest, their "Fibonacci" type. The namesake of an n log n-time sorting algorithm, it is implemented as a tree for which all children are less in value than their parents. For 10 points, name this range of allocata
Munro and Suwanda advocate using a bi-parental one in some cases, allowing for square root n search times. Their "soft" variety introduces "corruptions" to increase operation speed. Crane introduced one that uses an S-value and is unbalanced, the "leftist" type. Better amortized runtime than allowed by binomial ones is achieved by lazy evaluation made possible in a specially defined forest, their "Fibonacci" type. The namesake of an n log n-time sorting algorithm, it is implemented as a tree for which all children are less in value than their parents. For 10 points, name this range of allocatable memory named for its indeterminate shape and size.
Munro and Suwanda advocate using a bi-parental one in some cases, allowing for square root n search times.
{heap} [do not accept “tree” at any point; bi-parental trees do not make sense]