Node inside the linked list wrapping the actual data.
Functions
fn countChildren(node: *const Node) usize
Iterate over each next node, returning the count of all nodes except the startin…
Iterate over each next node, returning the count of all nodes except the starting one. This operation is O(N).
fn findLast(node: *Node) *Node
Iterate over the singly-linked list from this node, until the final node is foun…
Iterate over the singly-linked list from this node, until the final node is found. This operation is O(N).
fn insertAfter(node: *Node, new_node: *Node) void
Insert a new node after the current one.
Insert a new node after the current one.
Arguments: new_node: Pointer to the new node to insert.
fn removeNext(node: *Node) ?*Node
Remove a node from the list.
Remove a node from the list.
Arguments: node: Pointer to the node to be removed. Returns: node removed