binary search tree in rust

binary_search_tree.rs

enum BinaryTree {
    Node(int, Box<BinaryTree>, Box<BinaryTree>),
    Leaf
}

fn insert(tree:Box<BinaryTree>, value:int) -> Box<BinaryTree> {
    return box match (*tree) {
        Leaf => Node(value, box Leaf, box Leaf),
        Node(i, left, right) => if value < i {
            Node(i, insert(left, value), right)
        } else {
            Node(i, left, insert(right, value))
        }
                   
    };
}

fn print(tree:Box<BinaryTree>) -> () {
    match tree {
        box Leaf => (),
        box Node(i, box Leaf, right) => {println!("{}",i); print(right)},
        box Node(i, left, right) => {print(left); println!("{}",i); print(right)},
    };
    
    
}

fn main() {
    println!("Inserting 1,5,-11,12,-100,999,77 into tree");
    let mut tree = box Leaf;
    tree = insert(tree, 1);
    tree = insert(tree, 5);
    tree = insert(tree, -11);
    tree = insert(tree, 12);
    tree = insert(tree, -100);
    tree = insert(tree, 999);
    tree = insert(tree, 77);
    print(tree);
}