treers 0.1.2

Simple implementation of Sedgewick's tree maps
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
28
29
30
31

extern crate treers;

use treers::bst::BST;
use treers::{SedgewickMap, Traversals, TreeTraversal};

fn main() {
    let mut bst: BST<char, i32> = BST::new();
    bst.put('c', 3);
    bst.put('d', 4);
    bst.put('b', 2);
    bst.put('a', 1);
    println!("min = {}", bst.min().unwrap());
    println!("max = {}", bst.max().unwrap());
    println!("pre order traversal");
    for (a, _) in bst.traverse(&Traversals::PreOrder) {
        print!("{}, ", *a);
    }
    println!("\nin order traversal");
    for (a, _) in bst.traverse(&Traversals::InOrder) {
        print!("{}, ", *a);
    }
    println!("\npost order traversal");
    for (a, _) in bst.traverse(&Traversals::PostOrder) {
        print!("{}, ", *a);
    }
    println!("\nlevel order traversal");
    for (a, _) in bst.traverse(&Traversals::LevelOrder) {
        print!("{}, ", *a);
    }
    println!();
}