AVL Tree Map / Set in Rust
An ordered map / set implemented with an AVL tree (nearly balanced binary search tree) in Rust.
use AvlTreeMap;
let mut map = new;
map.insert;
map.insert;
map.insert;
assert_eq!;
map.remove;
assert!;
This is solely to get practice with the dark art of unsafe Rust. For all common purposes one of the standard library collections should be preferable.