Step 4 - If it is not Empty then, define two node pointers temp1 & temp2 and initialize temp1 with head.Step 3 - If it is Empty then, assign NULL to both newNode → previous & newNode → next and set newNode to head.Step 1 - Create a newNode with given value. We can use the following steps to insert a new node after a node in the double linked list. Inserting At Specific location in the list (After a Node) Step 6 - Assign newNode to temp → next and temp to newNode → previous.Step 5 - Keep moving the temp to its next node until it reaches to the last node in the list (until temp → next is equal to NULL).Step 4 - If it is not Empty, then, define a node pointer temp and initialize with head.Step 3 - If it is Empty, then assign NULL to newNode → previous and newNode to head.Step 1 - Create a newNode with given value and newNode → next as NULL.We can use the following steps to insert a new node at end of the double linked list. Step 4 - If it is not Empty then, assign head to newNode → next and newNode to head.Step 3 - If it is Empty then, assign NULL to newNode → next and newNode to head.Step 2 - Check whether list is Empty ( head = NULL).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |