Veri Yapıları

1. Chapter 4
Data Structures
Assoc. Prof. Dr. Oğuz FINDIK
2016-2017
KBUZEM
KARABUK UNIVERSITY
1

2.  An array is very useful data structure provided in
programming languages
 Has two limitations
its size has to be known at compilation time
the data in the array are separated in computer memory
by the same distance, which means that inserting an item
inside the array requires shifting other data in this array.
2
Linked List

3.  This limitation can be overcome by using linked structures.
 A linked structure is a collection of notes storing data and
links to other nodes.
 In this way, nodes can be located anywhere in memory,
and passing from one node of the linked structure to
another is accomplished by storing the addresses of the
other nodes in the linked structure.
3
Linked List

4. 4
A singly Linked List

5. typedef struct node {
int data;
int id;
struct node *next;
} node;
node *head = NULL;
5
Structures of List

6.  Adding is performed in four steps
 1. An empty node is created.
 2. The node’s member is initialized to particular values
 3. Because the node is being included at the front of the list ,
the next member becomes a pointer to the first node on the
list,that is the current value of head.
 4. The new node precedes all the nodes on the list.
Therefore, head is updated to become the pointer to the
new node.
6
Insertion

7. 7
inserting a new node at the
beginning of the singly linked list

8. node *insertNode(int data, node *head) {
node *link;
link = malloc(sizeof(node));
if (head == NULL) {
link->data = data;
link->id = ++id;
link->next = NULL;
head = link;
return head;
} else {
link->data = data;
link->id = ++id;
link->next = head;
head=link;
return head;
}}
8
inserting a new node at the
beginning of the singly linked list

9. 9
inserting a new node at the end of
the singly linked list

10. 10
Deleting a node from singly linked list

11. node *deleteNode(int key, node
*head) {
int tempid, tempdata;
node *ptr = head;
node *prior = NULL;
while (ptr != NULL) {
if (ptr->id == key) {
if (ptr == head) {
tempid = ptr->id;
tempdata = ptr->data;
head = head->next;
} 11
Deleting a node from singly linked list
}else {
tempid = ptr->id;
tempdata = ptr->data;
prior->next = ptr->next;
}printf("id:%3d data:%3d
silindinnn", tempid, tempdata);
break;
}
prior = ptr;
ptr = ptr->next;
}
return head;
}

12. void writeLinkedList(node *head) {
node *ptr = head;
while (ptr != NULL) {
printf("id:%3d data:%3dn", ptr->id, ptr->data);
ptr = ptr->next;
}
printf("n");
}
12
WriteLinkedList

13. void writeLinkedListRecursively(node *head) {
if (head == NULL) return;
writeLinkedListRecursively(head->next);
printf("id:%3d data:%3dn", head->id, head->data);
}
13
WriteLinkedListRecursively

14. 14
Doubly Linked List

15. 15
Adding a new node at the end of
doubly linked list

16. 16
circular singly and doubly Linked List