L4-Linked data structure link list and details.ppt

Linked data structure link list and details

1. Linked ListsLinked Lists

2. Menu
CSE@DIUCSE@DIU
struct 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);

3. Menu
CSE@DIUCSE@DIU
MenuMenu
Initialize
InsertBegin
InsertEnd
Insert
Find
Delete

4. Menu
CSE@DIUCSE@DIU
InitializeInitialize

5. Menu
CSE@DIUCSE@DIU
List Initialize()
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
return temp;
}

6. Menu
CSE@DIUCSE@DIU
List Initialize()
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
return temp;
}
X
head
main()
{
List head;
head = Initialize();
}

7. Menu
CSE@DIUCSE@DIU
InsertBeginInsertBegin

8. Menu
CSE@DIUCSE@DIU
X
head
110846325

9. Menu
CSE@DIUCSE@DIU
X
head
110846325
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = head->next;
head->next = temp;
}

10. Menu
CSE@DIUCSE@DIU
X
head
110846325
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = head->next;
head->next = temp;
}
1

11. Menu
CSE@DIUCSE@DIU
X
head
110846325
1

12. Menu
CSE@DIUCSE@DIU
110846325
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = head->next;
head->next = temp;
}
X
head
1

13. Menu
CSE@DIUCSE@DIU
110846325
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = head->next;
head->next = temp;
}
X
head
1

14. Menu
CSE@DIUCSE@DIU
110846325
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
head->next = temp;
temp->next = head->next;
}
X
head
1

15. Menu
CSE@DIUCSE@DIU
X
head
110846325
1
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = head->next;
head->next = temp;
}

16. Menu
CSE@DIUCSE@DIU
X
head
110846325
1
10
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = head->next;
head->next = temp;
}

17. Menu
CSE@DIUCSE@DIU
X
head
110846325
1
10
void InsertBegin(List head,int d)
{
Node* temp;
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
head->next = temp;
temp->next = head->next;
}

18. Menu
CSE@DIUCSE@DIU
InsertEndInsertEnd

19. Menu
CSE@DIUCSE@DIU
X
head
110846325
10 1
void InsertEnd(List head,int d)
{
Node *tail,*temp;
tail = head;
. . . . . . . .
. . . . . . . .
}
tail

20. Menu
CSE@DIUCSE@DIU
110846325
void InsertEnd(List head,int d)
{
Node *tail,*temp;
tail = head;
while(tail->next != NULL)
tail = tail->next;
. . . . . . . .
. . . . . . . .
}
X
head
10 1
tail

21. Menu
CSE@DIUCSE@DIU
110846325
void InsertEnd(List head,int d)
{
Node *tail,*temp;
tail = head;
while(tail->next != NULL)
tail = tail->next;
. . . . . . . .
. . . . . . . .
}
X
head
10 1
tail

22. Menu
CSE@DIUCSE@DIU
X
head
110846325
10 1
void InsertEnd(List head,int d)
{
. . . . . . . .
. . . . . . . .
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
tail->next = temp;
}
8
tail

23. Menu
CSE@DIUCSE@DIU
InsertInsert

24. Menu
CSE@DIUCSE@DIU
X
head
110846325
10 1 8
void Insert(List head,Node* p,int d)
{
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = p->next;
p->next = temp;
}

25. Menu
CSE@DIUCSE@DIU
X
head
110846325
10 1 8
4
void Insert(List head,Node* p,int d)
{
temp = (Node*)calloc(1,sizeof(Node));
temp->data = d;
temp->next = p->next;
p->next = temp;
}

26. Menu
CSE@DIUCSE@DIU
X
head
110846325
10 1 4 8

27. Menu
CSE@DIUCSE@DIU
FindFind

28. Menu
CSE@DIUCSE@DIU
X
head
110846325
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;
}

29. Menu
CSE@DIUCSE@DIU
X
head
110846325
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

30. Menu
CSE@DIUCSE@DIU
DeleteDelete

31. Menu
CSE@DIUCSE@DIU
X
head
110846325
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);
}
}

32. Menu
CSE@DIUCSE@DIU
X
head
110846325
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

33. Menu
CSE@DIUCSE@DIU
X
head
10846325
10 4 8

34. Menu
CSE@DIUCSE@DIU
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);
}

35. Menu
CSE@DIUCSE@DIU
Enjoy Linking You in ListEnjoy Linking You in List