Treap
id:
treap-188-18946608
title:
Treap
text:
In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys and allow binary searches among the keys. After any sequence of insertions and deletions of keys, the shape of the tree is a random variable with the same probability distribution as a random binary tree; in particular, with high probability its height is proportional to the logarithm of the number of keys, so that ea
brand slug:
wiki
category slug:
encyclopedia
description:
Random search tree data structure
original url:
https://en.wikipedia.org/wiki/Treap
date created:
2003-06-20T01:31:22Z
date modified:
2024-09-09T00:55:10Z
main entity:
{"identifier":"Q1757700","url":"https://www.wikidata.org/entity/Q1757700"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/e/e4/Treap.svg","width":286,"height":233}
fields total:
13
integrity:
16