Struct LinkedList 

pub struct LinkedList<T> { /* private fields */ }

A singly-linked list.

This structure represents a LinkedList where each node stores a value of type T and links to the next node in the sequence.

Implementations

impl<T> LinkedList<T>

pub fn new() -> Self

Creates a new and empty LinkedList.

Examples

use dsa::data_structures::linked_list::LinkedList;
 
let list: LinkedList<i32> = LinkedList::new();
assert!(list.is_empty());

pub fn push_front(&mut self, value: T)

Adds a value to the front of the LinkedList.

This method creates a new node containing the given value and makes it the new head of the list.

Examples

use dsa::data_structures::linked_list::LinkedList;
 
let mut list = LinkedList::new();
list.push_front(10);
list.push_front(20);
assert!(!list.is_empty());

pub fn pop_front(&mut self) -> Option<T>

Removes and returns the value from the front of the LinkedList.

If the list is empty, this method returns None. Otherwise, it removes the head node and returns its value.

Returns

An Option<T> optional generic type based on whether the topmost node was popped from the list

• Some node is returned if this LinkedList has a head, otherwise None

Examples

use dsa::data_structures::linked_list::LinkedList;
 
let mut list = LinkedList::new();

list.push_front(10);
list.push_front(20);
assert_eq!(list.pop_front(), Some(20));
assert_eq!(list.pop_front(), Some(10));
assert!(list.is_empty());

pub fn is_empty(&self) -> bool

Checks whether the LinkedList is empty.

Returns

A bool, true or false, based on whether this LinkedList is empty

Examples

use dsa::data_structures::linked_list::LinkedList;
 
let mut list = LinkedList::new();
assert!(list.is_empty());
list.push_front(10);
assert!(!list.is_empty());