teardown_tree___treap/
lib.rs

1
2//! Randomized Treap
3//!
4//! A treap is a variation of a binary tree. Each inserted key is assigned a priority and the
5//! resulting binary tree has the invariant that it is a binary search tree with respect to the
6//! keys and a max-heap with respect to the priorities.
7//!
8//! This implementation is randomized meaning that the priorities are assigned at random. The treap
9//! has an expected depth of O(log n).
10
11extern crate rand;
12
13pub use map::TreapMap;
14pub use set::TreapSet;
15
16mod node;
17pub mod map;
18pub mod set;