librualg 0.29.1

Collection of basic algorithms for everyday development
Documentation 
1
2
3
4
5
6
7
8
9
10
11

use librualg::binary_tree::BinaryTree;

#[test]
fn test() {
    let mut tree = BinaryTree::new();
    tree.add(3);
    tree.add(7);
    tree.add(2);
    assert_eq!(tree.get(&7), Some(&7));
    assert_eq!(tree.get(&8), None);
}