Min heap order

From Wikipedia, the free encyclopedia

You have new messages (last change).

"Min heap order" means that the key in each node in a heap structure is less than the key(s) in all nodes that are children of that node of interest. See Binary heap for more details on heaps.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../m/i/n/Min_heap_order.html"