Scribd
Upload
5 views

04 LinkedList

Uploaded by

madm85369
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

04 LinkedList

Uploaded by

madm85369
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

CS214-Data Structure

Lecturer: Dr. Salwa Osama


Linked Lists

1
List- What?
Lists

 A list is an sequential set of data items (values).

 In a general list:
 New values are added in position determined
by the user.
 Element is removed from a position determined
by the user.
How Lists Work?

Insertion position
0 n MAX-1

Insertion range
Should be shifted one cell right
New element
0 n+1
Insert New Element MAX-1

??
Shifted elements

We can insert a new element in position 0pn+1,


where n is the number of elements within the list.
How Lists Work?

Deletion position
0 n MAX-1

Deletion range
Should be shifted one cell left

0 n MAX-1
Delete an Element
??
Shifted elements

We can delete an element from position 0pn,where


n is the number of elements within the list.
Lists

Implementation User View


Lists

• Many applications require resizing, and the required size not


always immediately available.

• For those applications, the linked list is preferred.


Linked Lists

 Linked list is a linear data structure consisting of a sequence of


nodes connected to each other

 Each node stores:

Data
Link to the next node
Linked List

NULL
Linked List

Pointer to first Pointer to next


node node

Data NULL pointer (points to


member nothing)
Linked List

• They are dynamic data structure: That grow or shrink during the
execution of a program.

• Efficient memory utilization: Memory is allocated whenever it is


required. And it is de-allocated when it is not needed.
Linked List Implementation

info next

typedef char Entrytype;

typedef struct nodeT { Node is the basic


Entrytype info; block for the list
struct nodeT *next;
}Node;
typedef Node * ListType;

List
Linked List Implementation

info next

typedef char Entrytype;

typedef struct nodeT { Node is the basic


Entrytype info; block for the list
Better declaration:
struct nodeT *next; typedef struct{
}Node; Node * head;
typedef Node * ListType; } ListType;

List
OPERATIONS PERFORMED ON
LINKED LIST

 Create the list, leaving it empty.

 Determine whether the list is empty or not.

 Determine whether the list is full or not.

 Insert a new entry in a specific position.

 Retrieve an entry from a specific position.

 Clear the list to make it empty


Linked List Implementation

 Create operation:
Pre: None.
Post: The list is initialized to be empty.
void CreateList(ListType *L){
*L= NULL;
}
Linked List Implementation

 Create operation:
Pre: None.
Post: The list is initialized to be empty.
void CreateList(ListType *L){
If the list is declared as:
*L= NULL;
typedef struct{
} Node * head;
} ListType;

This statement should


be replaced by:
L->head = NULL;
Linked List Implementation

Empty operation:
Pre: The list is initialized.
Post: If the list is empty (1) is returned. Otherwise (0) is returned.
int EmptyList(ListType L){
return (L==NULL);}
Full operation:
Pre: The list is initialized.
Post: If the list is full (1) is returned. Otherwise (0) is returned.
int FullList(ListType L){
return 0;}
Linked List Implementation

 Insert operation:
Pre: The list is initialized, not full and 0<=pos<=size of the list. P

Post: Item is added to specific position of the list.


void Insert(ListType *L, Entrytype item, int pos){
33
Node *p = (Node *)malloc(sizeof(Node));
p->info = item;
if (pos==0){ //will work also for empty list
p->next=*L; *L = p; }
else{ Node *q; int i; P
for(q=*L, i=0; i<pos-1; i++)
q=q->next;
p->next=q->next;
q->next=p; } }
L
Linked List Implementation
 Retrieve operation:
Pre: The list is initialized, not empty and 0<=pos<=size of the list.
Post: An element has been retrieved from position pos.
void Retrieve(ListType *L, Entrytype *item, int pos){
int i; Node *q, *tmp;
if (pos==0){
*item=(*L)->info; tmp=*L; *L=(*L)->next;
free(tmp);} // it works also for one node
else{
for(q=*L, i=0; i<pos-1; i++) q=q->next;
*item=q->next->info;
tmp=q->next; q->next=tmp->next;
free(tmp); }// check for retrieving last node
tmp tmp
} L
Linked List Implementation

 Clear operation:
Pre: The list is initialized.
Post: the list is cleared to be empty.
void ClearList(ListType *L){

Node *q;
while(*L){
q = *L;
*L=(*L)->next;
free(q);
}
}
Think

 Could you keep track with the list size in the List ADT?!!
How?!! is that useful?!!

 Discuss, which is better array based or linked


implementation for lists.

 How to use the Linked List as a Linked Stack?!!

 How to use the Linked List as a Linked Queue?!!

1
Mostafa Abdo Salah
22

You might also like