binary heap (Q803847)

From Wikidata
Jump to navigation Jump to search
heap data structure that takes the form of a binary tree
edit
Language Label Description Also known as
English
binary heap
heap data structure that takes the form of a binary tree

    Statements

    subclass of
    complete binary tree
    0 references
    k-ary heap
    0 references
    d-ary heap
    0 references
    followed by
    ternary heap
    0 references
    studied in
    graph theory
    0 references
    worst-case time complexity
    of
    create
    1 reference
    stated in
    Introduction to Algorithms, Second Edition, German translation
    of
    insert
    1 reference
    stated in
    Introduction to Algorithms, Second Edition, German translation
    of
    delete minimum
    1 reference
    stated in
    Introduction to Algorithms, Second Edition, German translation
    of
    merge
    1 reference
    stated in
    Introduction to Algorithms, Second Edition, German translation
    of
    decrease key
    1 reference
    stated in
    Introduction to Algorithms, Second Edition, German translation
    of
    delete
    1 reference
    stated in
    Introduction to Algorithms, Second Edition, German translation
    Commons category
    Binary heaps
    0 references

    Identifiers

    GitHub topic
    binary-heap
    1 reference
    reference URL
    https://github.com/topics/binary-heap
    title
    binary-heap · GitHub Topics · GitHub (English)
    retrieved
    25 July 2021
     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                  Retrieved from "https://www.wikidata.org/w/index.php?title=Q803847&oldid=2069893165"