avltree 0.1.0

A very simple AVL tree implementation
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

# avl-tree-rust
An AVL tree implementation in Rust.

The current implementation stores the nodes in a `vec` inside the
`SearchTree` struct. The parent of a node and its children are referenced
using their index in the `vec`.

### Supported operations:
* insert
* lookup

## Example
Returning an iterator over the values in the tree:

 ```rust
extern crate avltree;

use avltree::SearchTree;

fn main() {
    let mut tree: SearchTree<u64> = SearchTree::new();
    tree.insert(5);
    tree.insert(2);
    tree.insert(1);
    assert!(tree.iter().zip(vec![1, 2, 5]).all(|(x, y)| *x == y));
}
```