avl/
avl.rs

1use avlsort::tree::*;
2
3fn main() {
4    let v = vec![1, 8, 7, 3, 5, 6, 2, 9, 4, 0, 4, 9];
5    let mut g = AvlTree::new();
6    println!("=== Push values in v. ===");
7    for &i in v.iter() {
8        let (rank, dup) = g.push(i);
9        println!("value={}| rank={}, dup={}", i, rank, dup);
10    }
11    println!("Elements in the tree = {}", g.len());
12    println!("");
13
14    println!("Height of the tree = {}", g.height());
15    println!("How many 4?: {}", g.count(4));
16    println!("remove 4: {:?}", g.remove(4));
17    println!("4 is in?: {}", g.isin(4));
18    println!("remove 4: {:?}", g.remove(4));
19    println!("4 is in?: {}", g.isin(4));
20    println!("");
21
22    println!("Max value = {}", g.max().unwrap());
23    let (value, dup) = g.pop_max_all().unwrap();
24    println!("Pop all the max value: value={}, dup={}", value, dup);
25    println!("");
26
27    println!("=== Show elements in ascending order. ===");
28    loop {
29        match g.pop_min() {
30            Some(value) => println!("Min value = {}", value),
31            None => break,
32        }
33    }
34}
avl/avl.rs

avl/
avl.rs
