Singly Linked List

Linked List
Prepared by Borisaniyabhavesh
Singly Linear Linked List
Linked List
9/9/2011
Node
NODE
INFO LINK
FIRST
60
Singly Linked List
Linked List
9/9/2011
Insertion at beginning
FIRST = INSERT (X, FIRST)
Function : INSERT (X, FIRST) X a new element FIRST a pointer to the first element of a linked linear list INFO data field of the node LINK a pointer to the next element in the list AVAIL a pointer to the top element of the availability stack NEW a temporary pointer variable
4 Linked List 9/9/2011
FIRST
60
AVAIL
Linked List
9/9/2011
FIRST
60
7
Function : INSERT (X, FIRST)
AVAIL
Linked List
9/9/2011
FIRST
60
7
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST)
AVAIL
Linked List
9/9/2011
FIRST
60
7
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST) 1. [Obtain address of next free node] NEW AVAIL
NEW = AVAIL
Linked List
9/9/2011
FIRST
60
7
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST) 1. [Obtain address of next free node] NEW AVAIL 1. [Remove free node from availability stack] AVAIL LINK(AVAIL)
NEW
AVAIL
Linked List
9/9/2011
FIRST
60
7
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST) 1. [Obtain address of next free node] NEW AVAIL 1. [Remove free node from availability stack] AVAIL LINK(AVAIL) 1. [Initialize fields of new node..] INFO(NEW) X
NEW
AVAIL
10
Linked List
9/9/2011
FIRST
60
7
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST) 1. [Obtain address of next free node] NEW AVAIL 1. [Remove free node from availability stack] AVAIL LINK(AVAIL) 1. [Initialize fields of new node..] INFO(NEW) X LINK(NEW) FIRST
9/9/2011
NEW
AVAIL
11
Linked List
FIRST
60
7
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST) 1. [Obtain address of next free node] NEW AVAIL 1. [Remove free node from availability stack] AVAIL LINK(AVAIL) 1. [Initialize fields of new node..] INFO(NEW) X LINK(NEW) FIRST 1. [Return address of new node] Return(NEW) 9/9/2011
NEW
AVAIL
12
Linked List
FIRST
60
AVAIL
13
Linked List
Function : INSERT (X, FIRST) 1. [Underflow ?] If AVAIL = NULL then Write(AVAIL UNDERFLOW) Return(FIRST) 1. [Obtain address of next free node] NEW AVAIL 1. [Remove free node from availability stack] AVAIL LINK(AVAIL) 1. [Initialize fields of new node..] INFO(NEW) X LINK(NEW) FIRST 1. [Return address of new node] Return(NEW) 9/9/2011
Function : INSERT (X, FIRST) 1. [Underflow ?]
If AVAIL = NULL then Write(AVAILABILITY STACK UNDERFLOW) Return(FIRST)
2.
[Obtain address of next free node]

NEW AVAIL
3. 4.
[Remove free node from availability stack]

AVAIL LINK(AVAIL) INFO(NEW) X LINK(NEW) FIRST
[Initialize fields of new node and its link to the list]

[Return address of new node]
Return(NEW)
9/9/2011
5.
14
Linked List
Program snippet
struct node_type{
int data; struct node_type *link;
};
struct node_type *insert (int x, struct node_type *f) { struct node_type *node; node=(struct node_type *)malloc(sizeof(node)); if(node!=NULL) { node->data=x;
node->link=f;
} else printf("memory underflow\n"); return(node); }
15
Linked List
9/9/2011
Insertion at end
FIRST = INSEND(X, FIRST)
Function : INSEND (X, FIRST) X a new element FIRST a pointer to the first element of a linked linear list INFO data field of the node LINK a pointer to the next element in the list AVAIL a pointer to the top element of the availability stack NEW a temporary pointer variable SAVE a temporary pointer variable
Insertion at end
FIRST
60
7
Function : INSEND (X, FIRST) 1. [Underflow ?]
NEW
5
2. 3. 4.

NEW AVAIL

AVAIL LINK(AVAIL)

INFO(NEW) X LINK(NEW) NULL
9/9/2011
17
Linked List
Insertion at end
FIRST
60
5.
[Is the list empty]
If FIRST = NULL then Return(NEW)
NEW
18
9/9/2011
Insertion at end
FIRST
60
5. 6.
[Is the list empty]
NEW
[Initiate search for the last node]

SAVE FIRST
19
9/9/2011
Insertion at end
FIRST
60
SAVE
5. 6.
[Is the list empty]
NEW

SAVE FIRST
20
9/9/2011
Insertion at end
FIRST
60
SAVE
5. 6. 5.
[Is the list empty]
NEW

SAVE FIRST
[Search for end of list]

Repeat while LINK(SAVE) != NULL SAVE LINK(SAVE)
21
9/9/2011
Insertion at end
FIRST
60
7
SAVE
5. 6. 5.
[Is the list empty]
NEW

SAVE FIRST

22
9/9/2011
Insertion at end
FIRST
60
7
SAVE
5. 6. 5.
[Is the list empty]
NEW

SAVE FIRST

5.
[Set LINK field of last node to NEW]

LINK(SAVE) NEW
23
9/9/2011
Insertion at end
FIRST
60
7
SAVE
5. 6. 5.
[Is the list empty]
NEW

SAVE FIRST

5.

LINK(SAVE) NEW
24
9/9/2011
Insertion at end
FIRST
60
7
SAVE
5. 6. 5.
[Is the list empty]
NEW

SAVE FIRST

5.
5.
25

LINK(SAVE) NEW Return(FIRST)
9/9/2011
[Return first node pointer]
Insertion at end
FIRST
60
5. 6. 5.
[Is the list empty]

SAVE FIRST

5.
5.
26

LINK(SAVE) NEW Return(FIRST)
9/9/2011
Insertion at end
Function : INSEND (X, FIRST) (continue) 1. [Underflow ?]
2.

NEW AVAIL
3. 4.

AVAIL LINK(AVAIL) INFO(NEW) X LINK(NEW) NULL

[Is the list empty]
9/9/2011
5.
27
Linked List
Insertion at end
6.
7.

SAVE FIRST

8.
9.

LINK(SAVE) NEW

Return(FIRST)
28
Linked List
9/9/2011
Ordered Linked List

Inserting a node into an ordered linear list
Algorithm 1. Remove a node from the availability stack 2. Set the fields of the new node 3. If the linked list is empty then return the address of the new node 4. If the node precedes all others in the list then insert the node at front of the list and return its address 5. Obtain the next node in the linked list 6. Insert the new node in the list and return address of its first node
Insertion in ordered linked list

FIRST = INSORD(X, FIRST)
Function : INSORD (X, FIRST) X a new element FIRST a pointer to the first element of a linked linear list INFO data field of the node LINK a pointer to the next element in the list AVAIL a pointer to the top element of the availability stack NEW a temporary pointer variable SAVE a temporary pointer variable

Function : INSORD (X, FIRST) 1. [Underflow ?]

2. 3.
4. 5.
[Obtain address of next free node] NEW AVAIL [Remove free node from availability stack] AVAIL LINK(AVAIL) [Copy information contents into new node] INFO(NEW) X [Is the list empty ?] If FIRST = NULL then LINK(NEW) NULL Return(NEW)
9/9/2011
31
Linked List

6.
[Does the new node precede all others in the list ?]

If INFO(NEW) <= INFO(FIRST) then LINK(NEW) FIRST Return(NEW)
7. 8.
[Initialize the temporary pointer]

SAVE FIRST
[Search for predecessor of new node]

Repeat while LINK(SAVE) != NULL and INFO(LINK(SAVE)) <= INFO(NEW) SAVE LINK(SAVE)
9.
[Set link fields of new node and its predecessor]

LINK(NEW) LINK(SAVE) LINK(SAVE) NEW Return(FIRST)
10. [Return first node pointer]
32
Linked List
9/9/2011
Deleting a node from linked linear list

Algorithm 1. If the linked list is empty then write underflow and return 2. Repeat step 3 while the end of the list has not been reached and the node has not been found 3. Obtain the next node in the list and record its predecessor node 4. If the end of the list has been reached then write node not found and return 5. Delete the node from the list 6. Return the node to the availability area

DELETE(X, FIRST)
Procedure : DELETE (X, FIRST) X the address of a node to be deleted FIRST a pointer to the first element of a linked linear list INFO data field of the node LINK a pointer to the next element in the list TEMP a pointer used to find the desired node PRED pointer keeps track of the predecessor of TEMP

Procedure : DELETE (X, FIRST) 1. [Empty list ?]
If FIRST = NULL then Write(UNDERFLOW) Return

2. 3. 4. 5.
[Initialize search for X

TEMP FIRST
[Find X]
Repeat thru step5 while TEMP != X and LINK(TEMP) != NULL
[Update predecessor marker]

PRED TEMP
[Move to next node]
TEMP LINK(TEMP)
9/9/2011
35
Linked List

6.
[End of the list ?]

If TEMP != X then Write (NODE NOT FOUND) Return
7.
[Delete X]
If X = FIRST (Is X the first node ?) then FIRST LINK(FIRST) else LINK(PRED) LINK(X)
8.
[Return node to availability area

LINK(X) AVAIL AVAIL X Return
36
Linked List
9/9/2011

Singly Linked List

Enviado por

Dados do documento

Descrição original:

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Singly Linked List

Enviado por

Direitos autorais:

Formatos disponíveis

Linked List

Singly Linear Linked List

[Obtain address of next free node]

[Remove free node from availability stack]

[Initialize fields of new node and its link to the list]

If AVAIL = NULL then Write(AVAILABILITY STACK UNDERFLOW) Return(FIRST)

[Obtain address of next free node]

[Remove free node from availability stack]

[Initialize fields of new node and its link to the list]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Search for end of list]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Search for end of list]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Search for end of list]

[Set LINK field of last node to NEW]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Search for end of list]

[Set LINK field of last node to NEW]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Search for end of list]

[Set LINK field of last node to NEW]

[Return first node pointer]

[Is the list empty]

If FIRST = NULL then Return(NEW)

[Initiate search for the last node]

[Search for end of list]

[Set LINK field of last node to NEW]

[Return first node pointer]

[Obtain address of next free node]

[Remove free node from availability stack]

[Initialize fields of new node and its link to the list]

[Initiate search for the last node]

[Search for end of list]

[Set LINK field of last node to NEW]

[Return first node pointer]

Ordered Linked List

Insertion in ordered linked list

Insertion in ordered linked list

If AVAIL = NULL then Write(AVAILABILITY STACK UNDERFLOW) Return(FIRST)

Insertion in ordered linked list

[Does the new node precede all others in the list ?]

[Initialize the temporary pointer]

[Search for predecessor of new node]

[Set link fields of new node and its predecessor]