data-structures-algorithms 1.0.0

Data Structures and Algorithms in Rust!
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

/// A node in a data structure.
///
/// This structure represents a single node that stores a value of type `T`
/// and optionally links to the next node in the list.
pub struct Node<T> {
    /// The value stored in this node.
    pub value: T,

    /// The next node in the structure
    /// or `None` if this is the last node.
    pub next: Option<Box<Node<T>>>,
}

impl<T> Node<T> {
    /// Creates a new node with the given value.
    pub fn new(value: T, next: Option<Box<Node<T>>>) -> Self {
        Node {
            value,
            next,
        }
    }
}