treap

A treap is a data structure that combines the properties of a binary search tree and a heap. The binary search tree property maintains the order of the keys, while the heap property ensures the keys are prioritized based on a specific value. This combination allows for efficient insertion, deletion, and searching of elements in logarithmic time complexity.

Explore

Requires login.