Linked Lists struct node int data struct node

  • Slides: 35
Download presentation
Linked Lists

Linked Lists

struct node { int data; struct node* next; }; Menu typedef struct node Node;

struct node { int data; struct node* next; }; Menu typedef struct node Node; typedef struct node* List; List Initialize(); void Insert. Begin(List l, int d); void Insert. End(List l, int d); void Insert(List l, Node* pos, int d); Node* Find(List l, int d); void Delete(List l, int d); 2

Menu Initialize Insert. Begin Insert. End Insert Find Delete 3

Menu Initialize Insert. Begin Insert. End Insert Find Delete 3

Menu Initialize 4

Menu Initialize 4

Menu List Initialize() { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); return temp; } 5

Menu List Initialize() { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); return temp; } 5

Menu head X List Initialize() { Node* temp; main() temp = (Node*)calloc(1, sizeof(Node)); {

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

Menu Insert. Begin 7

Menu Insert. Begin 7

Menu 1 10 8 4 6 3 2 5 head X 8

Menu 1 10 8 4 6 3 2 5 head X 8

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List head, int d) { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; temp->next = head->next; head->next = temp; } 9

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List head, int d) 1 { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; temp->next = head->next; head->next = temp; } 10

Menu 1 10 8 4 6 3 2 5 head X 1 11

Menu 1 10 8 4 6 3 2 5 head X 1 11

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List head, int d) 1 { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; temp->next = head->next; head->next = temp; } 12

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List head, int d) 1 { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; temp->next = head->next; head->next = temp; } 13

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List

Menu 1 10 8 4 6 3 2 5 head X void Insert. Begin(List head, int d) 1 { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; head->next = temp; temp->next = head->next; } 14

Menu 1 10 8 4 6 3 2 5 head X 1 void Insert.

Menu 1 10 8 4 6 3 2 5 head X 1 void Insert. Begin(List head, int d) { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; temp->next = head->next; head->next = temp; } 15

Menu 1 10 8 4 6 3 2 5 head X 1 void Insert.

Menu 1 10 8 4 6 3 2 5 head X 1 void Insert. Begin(List head, int d) 10 { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; temp->next = head->next; head->next = temp; } 16

Menu 1 10 8 4 6 3 2 5 head X 1 void Insert.

Menu 1 10 8 4 6 3 2 5 head X 1 void Insert. Begin(List head, int d) 10 { Node* temp; temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; head->next = temp; temp->next = head->next; } 17

Menu Insert. End 18

Menu Insert. End 18

Menu 1 10 8 4 6 3 2 5 head X 10 1 tail

Menu 1 10 8 4 6 3 2 5 head X 10 1 tail void Insert. End(List head, int d) { Node *tail, *temp; tail = head; . . . . } 19

Menu 1 10 8 4 6 3 2 5 head X 10 1 tail

Menu 1 10 8 4 6 3 2 5 head X 10 1 tail void Insert. End(List head, int d) { Node *tail, *temp; tail = head; while(tail->next != NULL) tail = tail->next; . . . . } 20

Menu 1 10 8 4 6 3 2 5 head X 10 1 tail

Menu 1 10 8 4 6 3 2 5 head X 10 1 tail void Insert. End(List head, int d) { Node *tail, *temp; tail = head; while(tail->next != NULL) tail = tail->next; . . . . } 21

Menu 1 10 head 8 4 6 3 2 5 tail X 10 1

Menu 1 10 head 8 4 6 3 2 5 tail X 10 1 8 void Insert. End(List head, int d) {. . . . temp = (Node*)calloc(1, sizeof(Node)); temp->data = d; tail->next = temp; } 22

Menu Insert 23

Menu Insert 23

Menu 1 10 8 4 6 3 2 5 head X 10 1 8

Menu 1 10 8 4 6 3 2 5 head X 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; 24

Menu 1 10 8 4 6 3 2 5 head X 10 1 4

Menu 1 10 8 4 6 3 2 5 head X 10 1 4 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 1 10 8 4 6 3 2 5 head X 10 1 4

Menu 1 10 8 4 6 3 2 5 head X 10 1 4 8 26

Menu Find 27

Menu Find 27

Menu 1 10 8 4 6 3 2 5 head X 10 1 4

Menu 1 10 8 4 6 3 2 5 head X 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; } 28

Menu 1 10 8 4 6 3 2 5 head temp X 10 1

Menu 1 10 8 4 6 3 2 5 head temp X 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 Delete 30

Menu Delete 30

Menu 1 10 8 4 6 3 2 5 head X 10 1 4

Menu 1 10 8 4 6 3 2 5 head X 10 1 4 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); } } 31

Menu 1 head 10 8 temp X 10 4 6 3 2 5 del

Menu 1 head 10 8 temp X 10 4 6 3 2 5 del 1 4 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 10 8 4 6 3 2 5 head X 10 4 8 33

Menu 10 8 4 6 3 2 5 head X 10 4 8 33

Menu int main { List l; Node* temp; l = Initialize(); Insert. Begin(l, 10);

Menu int main { List l; Node* temp; l = Initialize(); Insert. Begin(l, 10); Insert. End(l, 8); temp = Find(l, 8); Insert(l, temp, 4); Delete(l, 1); } 34

Menu The End 35

Menu The End 35

struct linked int data struct linked prev structstruct linked int data struct linked prev struct
struct node struct node next typedef struct nodestruct node struct node next typedef struct node
linked lists definition struct Node int data Nodelinked lists definition struct Node int data Node
LINKED LISTS CSCD 216 Linked Lists Linked ListsLINKED LISTS CSCD 216 Linked Lists Linked Lists
23 struct NODE struct NODE next int data23 struct NODE struct NODE next int data
5 Node typedef struct Node int val struct5 Node typedef struct Node int val struct
Summary on linked lists Definition struct Node intSummary on linked lists Definition struct Node int
Doubly Linked Lists C struct node int numberDoubly Linked Lists C struct node int number
Summary on linked lists Definition struct Node intSummary on linked lists Definition struct Node int
Trie struct node int next26 int fail intTrie struct node int next26 int fail int
Linked List outline Why linked lists Linked listsLinked List outline Why linked lists Linked lists
struct Node Node next void data struct Liststruct Node Node next void data struct List
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
insertanode B typedef struct node int data structinsertanode B typedef struct node int data struct
2394 typedef struct Tree Node int data struct2394 typedef struct Tree Node int data struct
7 3 2 struct node struct node leftchild7 3 2 struct node struct node leftchild
struct person char name int year struct nodestruct person char name int year struct node
Linked Lists DATA STRUCTURES Arrays versus Linked ListsLinked Lists DATA STRUCTURES Arrays versus Linked Lists
Node node 1 new Node node 1 dataNode node 1 new Node node 1 data
struct CADBANK int year int month struct OJTKOREAstruct CADBANK int year int month struct OJTKOREA
struct coord int x int y struct coordstruct coord int x int y struct coord
int i struct slist int sdata struct slistint i struct slist int sdata struct slist
l 8 struct struct jum int xaxis intl 8 struct struct jum int xaxis int