Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Min-max_heap> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Min-max_heap abstract "In computer science, a min-max heap is a double-ended priority queue implemented as a modified version of a binary heap. Like a binary heap, a min-max heap is represented as a complete binary tree. Unlike a binary heap, though, the nodes in this tree do not obey the min-heap property; rather they obey the min-max heap property: each node at an even level in the tree is less than all of its descendants, while each node at an odd level in the tree is greater than all of its descendants.Like binary heaps, min-max heaps support O(lg n) insertion and deletion, can be built in time O(n), and are often represented implicitly in an array. Operations like findmin() and findmax() take constant time.".
- Min-max_heap thumbnail Min-max_heap.jpg?width=300.
- Min-max_heap wikiPageExternalLink MinMaxHeaps.pdf.
- Min-max_heap wikiPageID "30317554".
- Min-max_heap wikiPageLength "5011".
- Min-max_heap wikiPageOutDegree "8".
- Min-max_heap wikiPageRevisionID "660805053".
- Min-max_heap wikiPageWikiLink Binary_heap.
- Min-max_heap wikiPageWikiLink Category:Heaps_(data_structures).
- Min-max_heap wikiPageWikiLink Category:Priority_queues.
- Min-max_heap wikiPageWikiLink Computer_science.
- Min-max_heap wikiPageWikiLink Double-ended_priority_queue.
- Min-max_heap wikiPageWikiLink Order_statistic_tree.
- Min-max_heap wikiPageWikiLink File:Min-max_heap.jpg.
- Min-max_heap wikiPageWikiLinkText "Min-max heap".
- Min-max_heap wikiPageWikiLinkText "min-max heap".
- Min-max_heap hasPhotoCollection Min-max_heap.
- Min-max_heap subject Category:Heaps_(data_structures).
- Min-max_heap subject Category:Priority_queues.
- Min-max_heap hypernym Queue.
- Min-max_heap type Article.
- Min-max_heap type Software.
- Min-max_heap type Type.
- Min-max_heap type Article.
- Min-max_heap type Page.
- Min-max_heap type Structure.
- Min-max_heap type Type.
- Min-max_heap comment "In computer science, a min-max heap is a double-ended priority queue implemented as a modified version of a binary heap. Like a binary heap, a min-max heap is represented as a complete binary tree.".
- Min-max_heap label "Min-max heap".
- Min-max_heap sameAs Min-Max-Heap.
- Min-max_heap sameAs m.0g5t5qn.
- Min-max_heap sameAs Q1936133.
- Min-max_heap sameAs Q1936133.
- Min-max_heap sameAs 最大—最小堆.
- Min-max_heap wasDerivedFrom Min-max_heap?oldid=660805053.
- Min-max_heap depiction Min-max_heap.jpg.
- Min-max_heap isPrimaryTopicOf Min-max_heap.
