I'm doing this challenge on Hacker Rank that wants me to implement a linked list.
It seems to want me to find the last-added instance of node and change its head to link to my new instance of node. Therefore the last instance added would have
head=None (I'm using Python).
This is the pic they provide -
Wouldn't it make more sense to create a node instance with its head linked to the previous node? That way the only node with
head=None would be the first node created.
I've seen conflicting suggestions so far. I'm not a CS student or developer.
This example from Youtube (1.36) suggests the second method.
Sorry if this seemed like a programming question. I'm trying to see if there's a logical way to set up linked lists for my own benefit... solving the HackerRank challenge is not the issue.