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.

Dwustronna kolejka priorytetowa · Vinony

🌐Polski

English Polski Русский العربية فارسی 中文

EntityQ5299591· pop 6· linked from 64 articles

Dwustronna kolejka priorytetowa

abstract data structure that supports removal of maximum- and minimum-priority elements

Available in 5 languages

中文
Ukrainian
zh_yue
فارسی

via Wikidata sitelinks · CC0

Connections

self-balancing binary search tree

Categories

Abstract data types Heaps (data structures)Priority queues

Sources

wikipedia.externallinksexternallink

computer science

Entity

International Standard Book Number

array data structure

binary search tree

red–black tree

abstract data type

associative array

Sign in to save

What links here64 pages

double-ended queue

self-balancing binary search tree

binary search tree

graph data structure

circular buffer

linked data structure

abstract data type

disjoint-set data structure

array data structure

Similar entities

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

Entitydist 0.64

high availability

Entitydist 0.65

infimum and supremum

Entitydist 0.68

IEEE Emanuel R. Piore Award

Entitydist 0.68

information filtering system

Entitydist 0.69

Entitydist 0.71

Pseudorandom function family

Entitydist 0.71

Cost-plus pricing

Entitydist 0.71

function overloading

Entitydist 0.71

alpha–beta pruning

Entitydist 0.72

Entitydist 0.72

randomized algorithm

Entitydist 0.73