how to have a loop that both adds to the end of a singly linked list and adding between two existing elements in a singly linked list

Question

could someone please show me an example of how to have a loop that both adds to the end of a singly linked list and adding between two existing elements in a singly linked list in c#.

Answer 1

if (newData.data < first.data) //newData must be the first

{

newData.next = first

first = newData

}

else if (newData.data> last.data) //new data must be the last

{

newData.next = null;

last.next = newData;

last = last.next;

}

else //must go somewhere in between

{

cur=first;

while (cur.data < newData.data)

{

cur = cur.next;

}

prev = first;

while (prev.next != cur)

{

prev = prev.next;

}

newData.next = cur;

prev.next = newData;

}

Answer 2

It sounds like you're asking how to implement insertion and append operations for singly linked lists.

To append a node to the end of a linked list if you have access to the head node, would require you to loop through to the end of the list unit the next property points to a null value. At that point, you would point next to null.

A pseudocode implementation of the append operation can be seen below:

nodeToAppend = new Node;

currentNode = headOfList;

while (currentNode.next != null) {

currentNode = currentNode.next;

}

currentNode.next = nodeToAppend;

The insertion operation is a little trickier. You want to iterate through the list until you reach the point where you want to insert. Perhaps this is some index, or maybe you want to insert a node after encountering a certain value.

Once you find the desired point of insertion, point the next property on the node you want to insert to the node after the one you stopped on. Then, point the next property of the node you stopped on to the node you want to insert.

It's important to execute the steps in that order to avoid loosing access to part of the list.

Here is a pseudocode implementation:

nodeToInsert = new Node;

currentNode = headofList;

while (currentNode is does not meet the condition of insertion){

currentNode = currentNode.next;

}

nodeToInsert.next = currentNode.next;

currentNode.next = nodeToInsert;

This article has some good information on linked list operations:

https://www.geeksforgeeks.org/linked-list-set-2-inserting-a-node/