Their decrease-key operation can be done in O (1) ("big O of one") amortized time in one variant of this whose amortized runtime is analyzed using a potential function which is equal to double the number of marked nodes plus the number of trees. The runtime of Dijkstra's algorithm can be improved by using priority queues that implement that kind of this data structure, which is named for Fibonacci. Smoothsort is a variation of an algorithm that runs in O ( n log n ) (read:"big O of n log n") time, and has a better worst-case runtime than quicksort, and unlike quicksort, uses only constant auxiliary space. That is its namesake sorting algorithm. In the max version of this data structure, the 
Their decrease-key operation can be done in O (1) ("big O of one") amortized time in one variant of this whose amortized runtime is analyzed using a potential function which is equal to double the number of marked nodes plus the number of trees. The runtime of Dijkstra's algorithm can be improved by using priority queues that implement that kind of this data structure, which is named for Fibonacci. Smoothsort is a variation of an algorithm that runs in O ( n log n ) (read:"big O of n log n") time, and has a better worst-case runtime than quicksort, and unlike quicksort, uses only constant auxiliary space. That is its namesake sorting algorithm. In the max version of this data structure, the root node is always the largest. For 10 points, name this tree-based data structure whose namesake property means that child nodes are always smaller or always larger than their parents.
Their decrease-key operation can be done in O (1) ("big O of one") amortized time in one variant of this whose amortized runtime is analyzed using a potential function which is equal to double the number of marked nodes plus the number of trees.
{heap}