create a linked list in rust

main.rs
// Define a node struct which will hold data and a pointer to the next node
struct Node<T> {
    data: T,
    next: Option<Box<Node<T>>>,
}

// Define a linked list struct which will hold a pointer to the head node
struct LinkedList<T> {
    head: Option<Box<Node<T>>>,
}

// Implementation of the linked list
impl<T> LinkedList<T> {
    // Function to create an empty linked list
    fn new() -> Self {
        LinkedList { head: None }
    }

    // Function to add a new node to the linked list
    fn push(&mut self, data: T) {
        let new_node = Node {
            data: data,
            next: self.head.take(),
        };
        self.head = Some(Box::new(new_node));
    }

    // Function to remove the first node of the linked list
    fn pop(&mut self) -> Option<T> {
        self.head.take().map(|node| {
            self.head = node.next;
            node.data
        })
    }

    // Function to check if the linked list is empty
    fn is_empty(&self) -> bool {
        self.head.is_none()
    }
}

// Example usage
fn main() {
    let mut list = LinkedList::new();
    list.push(1);
    list.push(2);
    list.push(3);

    while !list.is_empty() {
        println!("{}", list.pop().unwrap());
    }
}
1223 chars
53 lines