Beap

Data structure

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (May 2024) (Learn how and when to remove this message)

|

A beap, or bi-parental heap, is a data structure for a set (or map, or multiset or multimap) that enables elements (or mappings) to be located, inserted, or deleted in sublinear time. In a beap, each element is stored in a node with up to two parents and up to two children, with the property that the value of a parent node is never greater than the value of either of its children.

Beaps are implemented using an array containing only the values to be stored, with the parent-child relationships being determined implicitly by the array indices. (That is: beaps are an implicit data structure.) In that respect they are similar to binary heaps, which are usually implemented that way as well. However, their performance characteristics are different from heaps; in particular, a beap enables sublinear retrieval of arbitrary elements.

The beap was introduced by Ian Munro and Hendra Suwanda. A related data structure is the Young tableau.

Beap

## Performance

[edit]

The height of the structure is approximately  n {\displaystyle {\sqrt {n}}} . Also, assuming the last level is full, the number of elements on that level is also  n {\displaystyle {\sqrt {n}}} . In fact, because of these properties all basic operations (insert, remove, find) run in  O ( n ) {\displaystyle O({\sqrt {n}})} time on average. Find operations in the heap can be  O ( n ) {\displaystyle O(n)} in the worst case. Removal and insertion of new elements involves propagation of elements up or down (much like in a heap) in order to restore the beap invariant. An additional perk is that beap provides constant time access to the smallest element and  O ( n ) {\displaystyle O({\sqrt {n}})} time for the maximum element.

Actually, a  O ( n ) {\displaystyle O({\sqrt {n}})} find operation can be implemented if parent pointers at each node are maintained. You would start at the absolute bottom-most element of the top node (similar to the left-most child in a heap) and move either up or right to find the element of interest.

## References

[edit]

* Munro, J. Ian; Suwanda, Hendra (1980). "Implicit data structures for fast search and update". Journal of Computer and System Sciences. 21 (2): 236–250. doi:10.1016/0022-0000(80)90037-9.
* Williams, J. W. J. (Jun 1964). "Algorithm 232 - Heapsort". Communications of the ACM. 7 (6): 347–348. doi:10.1145/512274.512284.