For 10 points, name this data structure in which the key of a child node is either greater than or equal to the key of its parent node.
Fredman and Tarjan developed one type of this object that improves asymptotic running time for algorithms, and allows for "lazy" evaluation of operations. Another variety of these objects increase operational speed by introducing "corruptions". These structures are used in a sorting algorithm which removes the maximal element from one of these structures, puts it at the end of the sorted list, and rebuilds one of these structures; that algorithm has a better worst-case run time than quicksort. These structures are trees which satisfy a namesake ordering property. For 10 points, name this data structure in which the key of a child node is either greater than or equal to the key of its parent node.
Fredman and Tarjan developed one type of this object that improves asymptotic running time for algorithms, and allows for "lazy" evaluation of operations.
heap