I'm doing [this challenge](https://www.hackerrank.com/challenges/30-linked-list?h_r=next-challenge&h_v=zen) 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 -

![Image example](https://s3.amazonaws.com/hr-challenge-images/17168/1456961238-28488bfa0d-LinkedListExplanation.png) 

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.

EDIT -

[This example from Youtube](https://www.youtube.com/watch?v=Ast5sKQXxEU) (1.36) suggests the second method.