Algorithm in creating insert method in linked list?

Answer 1

You sort a doubly linked list the same way you sort any other kind of list or array.

You implement a procedure to sort the list or array, and that procedure calls the appropriate insert, delete, or move methods of the list or array.

Answer 2

step1- take the information to be insert e.g. n and take information where it should be inserted e.g.m

step2- compare it form the starting element of linked list till match

suppose root is starting pointer of list

then

x=root

while(x->data!= m)

{

y=x

x=x->next

}

create a new pointer

y->next=new

new->data=n

new->next=x

Answer 3

An algorithm is the step-by-step procedure required to resolve a computation. You would use an algorithm to insert a node, extract a node, detach and re-attach nodes, sort nodes, etc. Thus there is not one algorithm, but several independent algorithms, which will differ slightly depending on whether the list is singly-linked or doubly-linked.

Answer 4

As with all algorithms, you begin by flow-charting the procedures. With doubly-linked lists, the two main procedures are insertions to and deletions from the list. For instance, to insert a node anywhere in the list between a given previous and next node (either of which may be NULL if the list is empty, or only has one node), then you would use the following procedure:

node.prev=prev;

if(prev)

prev.next=node;

else

head=node;

next.prev=node;

if(next)

node.next=next;

else

tail=node;

And to delete a given node, you use the following procedure:

if(node.prev) node.prev.next=node.next;

if(node.next ) node.next.prev=node.prev;

if(node==head) head=node.next;

if(node==tail) tail=node.prev;

delete( node );

Answer 5

There are three ways to insert an algorithm into a doubly linked list. These consist of insertion at the front, insertion in the middle, or insertion at the end.