struct LinkedListNode {
    next : Option<Box<LinkedList>>,
    data : i32
}
struct LinkedList {
    head : Option<Box<LinkedList>>
}
impl LinkedList {
    fn new() -> LinkedList {
        LinkedList {head: None}
    }
    fn insert(&self, new_data : i32) {
        let mut next = self.head;
        let mut next_link : Box<LinkedList>;
        loop {
            next_link = match next {
                Some(n) => *n.next,
                None => {
                    break;
                }
            };
            println!("Next: {} ", *next_link.data);
            next = next_link.data;
        
        }
        next_link = LinkedListNode {None, new_data};        
    }
}

fn main(){
    let llist = LinkedList::new();
    llist.insert(5);
}