Weak heap: Difference between revisions
Content deletedContent added
addedCategory:Heaps (data structures)usingHotCat |
|||
| Line 14: | Line 14: | ||
==References== |
==References== |
||
{{Reflist}} |
{{Reflist}} |
||
[[Category:Heaps (data structures)]] |
|||
Revision as of 18:28, 30 November 2015
An editor has nominated this article for deletion. You are welcome to participate inthe deletion discussion,which will decidewhether or not to retain it. |
Aweak heapis a sub-form of aheapdata structure. It is a relaxed heap satisfying the following three conditions:
- every key in the right subtree of a node is greater than the key stored in the node itself,
- the root has no left child
- leaves are only found on the last two levels of the tree.[1]
It's form supports finding the minimum value in it with O(1) worst-case time.
It is also useful for insert and delete-min or delete and decrease, with a worst-case time of O(ln(n)).
References
- ^Stefan Edelkamp, "weak-heap", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 26 May 2011. (accessed TODAY) Available from:http://www.nist.gov/dads/HTML/weakheap.html