For ten points, name this term that identifies either an area of dynamic memory allocation analogous to the program stack, or a special case of a binary tree in which each child is either greater or less than its parent, both of which are named for their potentially arbitrary size.
This name is shared by two dissimilar entities, one of which can be managed with a so-called buddy block allocator that partitions data into the smallest chunk of size, two to the k. The data structure of this name can come Leftist or Fibonacci versions and is the basis for a namesake n log n sorting algorithm. For ten points, name this term that identifies either an area of dynamic memory allocation analogous to the program stack, or a special case of a binary tree in which each child is either greater or less than its parent, both of which are named for their potentially arbitrary size.
This name is shared by two dissimilar entities, one of which can be managed with a so-called buddy block allocator that partitions data into the smallest chunk of size, two to the k.
{heap}