treap
binary search tree in which the nodes are heap-ordered by random priorities
Facts
7 properties- Subclass of
- binary heap, binary search tree, random binary tree[1][2][3]
- 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 ↗
- Freebase ID
- /m/01l27f
- Microsoft Academic ID (discontinued)
- 150978202
🔗 Connections
Created notable works 2
Subclass of 2
Studied by 1
Subtypes 1
Press Enter · cited answer in seconds