Its namesake sort has complexity bound of order n log n, and its nodes usually satisfy the property that the children are either consistently lesser or greater than their parents.
The Fibonacci type can notably perform many common operations with almost constant amortized cost, and they are often used to implement priority queues. Key to executing many graph algorithms, such as Dijkstra's, they are often implemented in arrays with adjacent elements being widely separated by index. Its namesake sort has complexity bound of order n log n, and its nodes usually satisfy the property that the children are either consistently lesser or greater than their parents. For 10 points, name this tree-based data structure.
The Fibonacci type can notably perform many common operations with almost constant amortized cost, and they are often used to implement priority queues.
{heap}