binomial heap (Q864032)

From Wikidata
Jump to navigation Jump to search
priority queue made from heap-ordered trees with power-of-two sizes
edit
Language Label Description Also known as
English
binomial heap
priority queue made from heap-ordered trees with power-of-two sizes

    Statements

    instance of
    heap
    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
    find minimum
    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
    Binomial heap
    0 references

    Identifiers

     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                  Retrieved from "https://www.wikidata.org/w/index.php?title=Q864032&oldid=2250219704"