avl-cont

A contiguous AVL Tree. Written by Toni Jarjour.

```rust let mut tree = binary_search::Tree::default();

// Insert values. for n in 0..1000 { tree.insert(n); }

// Remove a value. asserteq!(tree.remove(&511).unwrap(), 511); asserteq!(tree.contains(&511), None);

// Check if a value is in the tree, returns its index. let value_index = tree.contains(&732).unwrap();

// Get a reference to the value. asserteq!(tree.get(valueindex).unwrap(), &732); ```