e/Beap

Information
has gloss	eng: Beap, short for bi-parental heap, introduced by Ian Munro and Hendra Suwanda. In this data structure a node usually has two parents (unless it is the first or last on a level) and two children (unless it is on the last level). What separates the beap from Williams' heap is that beap allows sublinear search.
lexicalization	eng: beap
instance of	e/Heap data structure

Media
media:img	Beap.jpg