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.

هرم دودویی · Vinony

🌐فارسی

English Deutsch Español Français Italiano Polski Tiếng Việt Русский العربية فارسی ไทย 한국어 中文日本語

EntityQ803847· pop 23· linked from 157 articles

هرم دودویی

heap data structure that takes the form of a binary tree

Available in 22 languages

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

Connections

array data structure

Categories

Binary trees Heaps (data structures)

Sources

wikipedia.externallinksexternallink

Show 3 more

فارسی
ไทย
한국어

via Wikidata sitelinks · CC0

time complexity

Entity

International Standard Book Number

programming language

Wayback Machine

digital object identifier

International Standard Serial Number

sorting algorithm

Sign in to save

Similar entities

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

Entitydist 0.44

threaded binary tree

Entitydist 0.44

Entitydist 0.45

red–black tree

Entitydist 0.45

Entitydist 0.45

weight-balanced tree

Entitydist 0.45

Entitydist 0.48

self-balancing binary search tree

Entitydist 0.48

Entitydist 0.50

Entitydist 0.50

Entitydist 0.50

Entitydist 0.55

What links here157 pages

double-ended priority queue

binary search tree

purely functional programming

self-balancing binary search tree

subset sum problem

ternary search tree

Dijkstra's algorithm

Van Emde Boas tree

graph data structure

functional programming