skew heaps
Skew heaps are binary heaps that prioritize merging operations over insertion and deletion operations. They are based on the concept of binary trees, where each node has at most two children. Skew heaps have the property that the value of each node is greater than the values in its left and right subtrees, which can differ from the traditional heap property. This allows for easy merging of two skew heaps by making one the left child of the other. The runtime complexity of merging two skew heaps is O(log n), making them efficient for certain applications.
Requires login.