splay-tree-rs 0.1.1

The implementation of data structure splay tree in Rust. Splay tree uses splay algorithm to balance itself and it allows to access node (insert, search, delete) on average of O(logn).
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

# Splay Tree


This repository contains the library of splay tree that implemented in Rust. 

You can add this crate as dependence by:

```toml
[dependencies]
splay-tree-rs = "0.1.1"
```

The main algorithm of splay function is reference from:
http://ccf.ee.ntu.edu.tw/~yen/courses/ds17/chapter-4c.pdf

All the codes are under MIT License.