Struct LinkedList

pub struct LinkedList<T>(/* private fields */)
where
    T: PartialEq;

Implementations

impl<T: PartialEq> LinkedList<T>

pub fn new() -> LinkedList<T>

Trait Implementations

impl<T> Debug for LinkedList<T>

where T: PartialEq + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: PartialEq> Tree for LinkedList<T>

fn add(&mut self, key: Self::Item)

adds ‘key’ to the beginning of ‘self’ because it adds to the beginning, it has O(1) time complexity

type Item = T

fn find(&self, key: Self::Item) -> Option<&Self>

returns the optional subtree containing key

fn delete(&self, key: Self::Item)

deletes ‘key’ from ‘self’