Definition: A priority queue implemented with a binary tree having the following restrictions:
Generalization (I am a kind of ...)
Aggregate child (... is a part of or used in me.)
binary tree, heap property.
See also leftist tree, heap.
Note: The subtree restriction means that when inserting at a leaf, the left subtree is always used before the right subtree. Favoring the left subtree tends to make the tree taller and thinner.
After [GBY91, pages 223-225].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 November 2009.
HTML page formatted Mon Nov 18 10:44:09 2013.
Cite this as:
Paul E. Black, "binary priority queue", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/binaryPriorityQueue.html