We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
You could definitely just return tmp, and in fact would be more efficient. I just did it this way for my own understanding of making it clear what my intention was. The intention being: if the list is empty, assign our new node (tmp) to the head.
Insert a Node at the Tail of a Linked List
You are viewing a single comment's thread. Return to all comments →
In your code:
Why not simply return
tmpinstead of re-assigningheadtotmpand then returninghead?Just curious. Thanks!
You could definitely just return tmp, and in fact would be more efficient. I just did it this way for my own understanding of making it clear what my intention was. The intention being: if the list is empty, assign our new node (tmp) to the head.