Resolve
RDF Terms

    Data based on @zazuko/vocabularies
    Defined by qudt:
    Click to Copy
    qudt:HeapType
    Click to Copy
    http://qudt.org/schema/qudt/HeapType

    Recommended prefix

    Copy 'PREFIX qudt: <http://qudt.org/schema/qudt/>'

    qudt:

    rdf: type
    owl:Class
    rdfs: label
    lang:""
    Heap Type
    rdfs: comment
    lang:""
    A heap is a specialized tree-based data structure that satisfies the condition: if B is a child node of A, then key(A) > key(B). This implies that an element with the greatest key is always in the root node, and so such a heap is sometimes called a max heap. Alternatively, if the comparison is reversed, the smallest element is always in the root node, which results in a min heap. The function or method that implements the key() operator is specified by the heap type.
    rdfs: subClassOf
    qudt:OrderedTreeType
    prov: wasInfluencedBy