Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

binomial heap · Vinony

🌐English

English Deutsch Español Français Italiano Nederlands Polski Português Русский العربية فارسی ไทย 한국어 中文日本語

EntityQ864032· pop 18· linked from 138 articles

binomial heap

priority queue made from heap-ordered trees with power-of-two sizes

Available in 17 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية
Czech
Hebrew

Connections

Categories

Heaps (data structures)

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

binary tree

Entity

amortized analysis

computer science

International Standard Book Number

digital object identifier

binary numeral system

International Standard Serial Number

array data structure

binomial coefficient

On-Line Encyclopedia of Integer Sequences

computational complexity theory

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

comparability graph

Entitydist 0.60

Entitydist 0.64

Entitydist 0.64

well-quasi-ordering

Entitydist 0.65

Entitydist 0.66

Entitydist 0.66

out-of-order execution

Entitydist 0.66

Entitydist 0.66

Entitydist 0.66

self-organizing list

Entitydist 0.66

Symmetric Turing machine

Entitydist 0.67

Entitydist 0.67

What links here138 pages

double-ended queue

self-balancing binary search tree

ternary search tree

binary search tree

Van Emde Boas tree

algorithmic efficiency

graph data structure

circular buffer

double-ended priority queue