mikel_binary_tree 0.1.7

Simple search binary tree implementation
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14

## Simple implementation of a binary tree.

### Example
```rust
fn main() {
    let mut a = BinaryTree::new(1);
    a.insert(2);
    a.vec_insert([1,2,3]);
    a.delete(1);
    for i in a.into_iter() {
        println!("{}", *i);
    }
}
```