Q1757700
From Wikidata
Treap
binary search tree in which the nodes are heap-ordered by random priorities
No aliases defined.
Statements
List of pages linked to this item
| Language | Code | Linked article | |
|---|---|---|---|
| Deutsch | de | Treap | |
| English | en | Treap | |
| فارسی | fa | داده ساختار تیریپ | |
| français | fr | Treap | |
| italiano | it | Treap | |
| 日本語 | ja | Treap | |
| русский | ru | Декартово дерево | |
| ไทย | th | ทรีพ | |
| українська | uk | Декартове дерево | |
| Tiếng Việt | vi | Treap | |
| 中文 | zh | 树堆 | |