linked-list.rs

pub struct SimpleLinkedList<T> {
    head: Option<Box<Element<T>>>,
}

pub struct Element<T> {
    data: T,
    next: Option<Box<Element<T>>>,
}

impl<T> SimpleLinkedList<T> {
    pub fn push(&mut self, element: T) {
        match &self.head {
            Some(head) => {
                // Loop until we find a node with None for next
                let mut cur = head;
                while let Some(next) = &cur.next {
                    cur = next;
                }
                cur.next = Some(Box::new(Element {
                    data: element,
                    next: None,
                }))
            }
            None => {
                self.head = Some(Box::new(Element {
                    data: element,
                    next: None,
                }))
            }
        }
    }
}