Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Pagoda_(data_structure)> ?p ?o }
Showing triples 1 to 27 of
27
with 100 triples per page.
- Pagoda_(data_structure) abstract "In computer science, a pagoda is a priority queue implemented with a variant of a binary tree. The root points to its children, as in a binary tree. Every other node points back to its parent and down to its leftmost (if it is a right child) or rightmost (if it is a left child) descendant leaf. The basic operation is merge or meld, which maintains the heap property. An element is inserted by merging it as a singleton. The root is removed by merging its right and left children. Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.".
- Pagoda_(data_structure) wikiPageID "14104194".
- Pagoda_(data_structure) wikiPageLength "963".
- Pagoda_(data_structure) wikiPageOutDegree "5".
- Pagoda_(data_structure) wikiPageRevisionID "549470812".
- Pagoda_(data_structure) wikiPageWikiLink Binary_tree.
- Pagoda_(data_structure) wikiPageWikiLink Category:Priority_queues.
- Pagoda_(data_structure) wikiPageWikiLink Computer_science.
- Pagoda_(data_structure) wikiPageWikiLink Heap_(data_structure).
- Pagoda_(data_structure) wikiPageWikiLink Priority_queue.
- Pagoda_(data_structure) wikiPageWikiLinkText "Pagoda (data structure)".
- Pagoda_(data_structure) wikiPageWikiLinkText "Pagoda".
- Pagoda_(data_structure) wikiPageWikiLinkText "pagoda".
- Pagoda_(data_structure) wikiPageUsesTemplate Template:DADS.
- Pagoda_(data_structure) subject Category:Priority_queues.
- Pagoda_(data_structure) hypernym Queue.
- Pagoda_(data_structure) type Software.
- Pagoda_(data_structure) type Type.
- Pagoda_(data_structure) type Structure.
- Pagoda_(data_structure) type Type.
- Pagoda_(data_structure) comment "In computer science, a pagoda is a priority queue implemented with a variant of a binary tree. The root points to its children, as in a binary tree. Every other node points back to its parent and down to its leftmost (if it is a right child) or rightmost (if it is a left child) descendant leaf. The basic operation is merge or meld, which maintains the heap property. An element is inserted by merging it as a singleton. The root is removed by merging its right and left children.".
- Pagoda_(data_structure) label "Pagoda (data structure)".
- Pagoda_(data_structure) sameAs Q7124395.
- Pagoda_(data_structure) sameAs m.03ctsxn.
- Pagoda_(data_structure) sameAs Q7124395.
- Pagoda_(data_structure) wasDerivedFrom Pagoda_(data_structure)?oldid=549470812.
- Pagoda_(data_structure) isPrimaryTopicOf Pagoda_(data_structure).