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.
We are given the pointer to the head of the linked list.
There are two scenarios here that we have to deal with
1. When the head node is already present
2. When the linked list is empty i.e. where there is no head node.
Scenario 1: Create a node and assign data as the data of the node and pass head (the pointer to the current head of the list) to the 'next_node' parameter of the Node constructor.
Scenario 2: Surprisingly the solution to the second situation is the same as well. Here, when we pass head (which in this case is NULL cos the list is empty to begin with), the new node is created with its 'next' attribute set to Null, meaning there is no second node in the list yet and the list contains only
one element so far, which is the head node we just created.
Hence the two scenarios can be condensed down into one single line which is what you have done here.
Hope it helped!!
after generates the node you need to specify that the next node will be the head new_node.next = head and then yes you can return the new_node because if not I think will only add the first element
Insert a node at the head of a linked list
You are viewing a single comment's thread. Return to all comments →
This one-liner C++14 code passed all the tests but it seems rather simple. Is it correct in general? (Sorry for noob question...)
ya its actual working!! but did get it
could u tell me....
code calling recursive called function
We are given the pointer to the head of the linked list. There are two scenarios here that we have to deal with 1. When the head node is already present 2. When the linked list is empty i.e. where there is no head node. Scenario 1: Create a node and assign data as the data of the node and pass head (the pointer to the current head of the list) to the 'next_node' parameter of the Node constructor. Scenario 2: Surprisingly the solution to the second situation is the same as well. Here, when we pass head (which in this case is NULL cos the list is empty to begin with), the new node is created with its 'next' attribute set to Null, meaning there is no second node in the list yet and the list contains only one element so far, which is the head node we just created.
Hence the two scenarios can be condensed down into one single line which is what you have done here. Hope it helped!!
I think it works, and for Python :
after generates the node you need to specify that the next node will be the head new_node.next = head and then yes you can return the new_node because if not I think will only add the first element