linked lists

Linked ListsLinked Lists

CH Gowri KumarCH Gowri Kumar

[email protected]@gmail.com

April 12, 2023April 12, 2023 http://www.gowrikumar.comhttp://www.gowrikumar.com

Menustruct node {int data;struct node* next;

};

typedef struct node Node;typedef struct node* List;

List Initialize();void InsertBegin(List l,int d);void InsertEnd(List l, int d);void Insert(List l, Node* pos,int d);Node* Find(List l,int d);void Delete(List l, int d);


MenuMenuMenu

InitializeInitialize

InsertBeginInsertBegin

InsertEndInsertEnd

InsertInsert

FindFind

DeleteDelete


Menu

InitializeInitialize


Menu

List Initialize()

{

Node* temp;

temp = (Node*)calloc(1,sizeof(Node));

return temp;

}


Menu

List Initialize()

{

Node* temp;


return temp;

}

X

head

main()

{

List head;

head = Initialize();

}


Menu

InsertBeginInsertBegin


Menu

X

head

1 10 8 4 6 3 2 5


Menu

X

head

1 10 8 4 6 3 2 5

void InsertBegin(List head,int d)

{

Node* temp;


temp->data = d;

temp->next = head->next;

head->next = temp;

}


Menu

X

head

1 10 8 4 6 3 2 5


{

Node* temp;


temp->data = d;


head->next = temp;

}

1


Menu

X

head

1 10 8 4 6 3 2 5

1


Menu1 10 8 4 6 3 2 5


{

Node* temp;


temp->data = d;


head->next = temp;

}

X

head

1


Menu1 10 8 4 6 3 2 5


{

Node* temp;


temp->data = d;

head->next = temp;


}

X

head

1


Menu

X

head

1 10 8 4 6 3 2 5

1


{

Node* temp;


temp->data = d;


head->next = temp;

}


Menu

X

head

1 10 8 4 6 3 2 5

1

10void InsertBegin(List head,int d)

{

Node* temp;


temp->data = d;


head->next = temp;

}


Menu

X

head

1 10 8 4 6 3 2 5

1

10void InsertBegin(List head,int d)

{

Node* temp;


temp->data = d;

head->next = temp;


}


Menu

InsertEndInsertEnd


Menu

X

head

1 10 8 4 6 3 2 5

10 1

void InsertEnd(List head,int d){

Node *tail,*temp;tail = head;. . . . . . . .. . . . . . . .

}

tail


Menu1 10 8 4 6 3 2 5


Node *tail,*temp;tail = head;while(tail->next != NULL)

tail = tail->next;. . . . . . . .. . . . . . . .

}

X

head

10 1

tail


Menu

X

head

1 10 8 4 6 3 2 5

10 1


. . . . . . . .

. . . . . . . . temp =

(Node*)calloc(1,sizeof(Node));temp->data = d;

tail->next = temp;

}

8

tail


Menu

InsertInsert


Menu

X

head

1 10 8 4 6 3 2 5

10 1 8

void Insert(List head,Node* p,int d){


temp->data = d;

temp->next = p->next;p->next = temp;

}


Menu

X

head

1 10 8 4 6 3 2 5

10 1 8

4void Insert(List head,Node* p,int d){


temp->data = d;

temp->next = p->next;p->next = temp;

}


Menu

X

head

1 10 8 4 6 3 2 5

10 1 4 8


Menu

FindFind


Menu

X

head

1 10 8 4 6 3 2 5

10 1 4 8

void Find(List l,Node* p,int d){

Node *temp;temp = l;while(temp->next != NULL){

if(temp->next->data == d)return temp;

temp = temp->next;}return NULL;

}


Menu

X

head

1 10 8 4 6 3 2 5

10 1 4 8

void Find(List l,Node* p,int d){

Node *temp;temp = l;while(temp->next != NULL){

if(temp->next->data == d)return temp;

temp = temp->next;}return NULL;

}

temp


Menu

DeleteDelete


Menu

X

head

1 10 8 4 6 3 2 5

10 41 8

void Delete(List l,Node* p,int d){

Node *temp,*del;temp = Find(l,d);if(temp != NULL){

del = temp->next;temp->next = del->next;free(del);

}}


Menu

X

head

1 10 8 4 6 3 2 5

10 41 8

void Delete(List l,Node* p,int d){

Node *temp,*del;temp = Find(l,d);if(temp != NULL){

del = temp->next;temp->next = del->next;free(del);

}}

temp del


Menu

X

head

10 8 4 6 3 2 5

10 4 8


Menu

int main

{

List l;

Node* temp;

l = Initialize();

InsertBegin(l,1);

InsertBegin(l,10);

InsertEnd(l,8);

temp = Find(l,8);

Insert(l,temp,4);

Delete(l,1);

}


Menu

The EndThe End

linked lists

Education

d temp

d return temp temp

temp tail

x head

list head head

sizeofnode tempdata

int d node

node node typedef