• + 0 comments
    1. Head is returned as a reference or pointer to the next node.
    2. With the help of head we'll traverse the complete list until we find the node (elif condition) which is pointing to the None or null.
    3. The first if condition is executed only when the list is completely empty.
    4. In this manner, recursive calls are made to insert function to reach the last node of the current list and then the passed data parameter is inserted there.