Node Creation - Algorithm

Here's your approach for linked nodes:

$1.$ Define a

Node struct with data and next pointer.

$2.$ Initialize head and tail to nullptr for an empty list.

$3.$ For each value to add: allocate a new node with new

Node(value, nullptr).

$4.$ If list is empty, set head and tail to the new node.

$5.$ Otherwise, link tail->next to new node, then update tail.

$6.$ To traverse, loop from head following next pointers.

$7.$ To free, delete each node while traversing, then set head to nullptr.