Skew Heap

Home > Computer Science > Algorithms and data structures > Heaps and Priority Queues > Skew Heap

A skew heap is a binary tree-based heap with the same heap property as a binary heap, but with no order in the right subtrees. It has the same time complexity as binary heap for most operations, but faster for merge operations.