avl_cont/
lib.rs

1pub mod binary_search;
2
3#[cfg(test)]
4mod data_structures {
5    use super::binary_search;
6
7    #[test]
8    fn avl_tree() {
9        let mut tree = binary_search::Tree::default();
10
11        // Insert values.
12        for n in 0..1000 {
13            tree.insert(n);
14        }
15
16        // Remove a value.
17        assert_eq!(tree.remove(511).unwrap(), 511);
18        assert_eq!(tree.contains(511), None);
19
20        // Check if a value is in the tree, returns its index.
21        let value_index = tree.contains(732).unwrap();
22
23        // Get a reference to the value.
24        assert_eq!(tree.get(value_index).unwrap(), &732);
25    }
26}