treap

binary search tree in which the nodes are heap-ordered by random priorities

Facts

7 properties
Average space complexity
O(n)[9]
Different from
Drzewiec[6]
Native label
Treap[5]
Studied by
graph theory[7]
Time of discovery or invention
1989[4]
Worst-case space complexity
O(n)[8]
🏷️ Also known as
en randomized binary search tree en treap de Baufen fa داده ساختار تیریپ fa دادهٔ ساختار تیریپ ko 트립 pl Drzewiec ru treap ru Декартово дерево th Treap th ทรีพ uk Декартове дерево zh Treap zh 树堆 zh-hant 樹堆
🔖 Identifiers · 4
Image (Wikimedia Commons)
Treap.svg ↗
Dictionary of Algorithms and Data Structures ID
treap, rbst
Freebase ID
/m/01l27f
Microsoft Academic ID (discontinued)
150978202

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Created notable works 2
Subclass of 2
Studied by 1
Subtypes 1
Press Enter · cited answer in seconds

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). treap. Retrieved November 18, 2026, from https://4ort.xyz/entity/treap
MLA “treap.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Nov. 2026, https://4ort.xyz/entity/treap.
BibTeX @misc{4ortxyz_treap_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{treap}}, year = {2026}, url = {https://4ort.xyz/entity/treap}, note = {Accessed: 2026-11-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): treap — https://4ort.xyz/entity/treap (retrieved 2026-11-18)

Canonical URL: https://4ort.xyz/entity/treap · Last refreshed: