Data structure day1
Download as PPTX, PDF1 like73 views
This document discusses data structures and linked lists. It explains that linked lists are linear data structures where elements are linked using pointers rather than being stored contiguously in memory like arrays. Linked lists allow for dynamic sizes and easier insertion/deletion compared to arrays since elements don't need to be reindexed. However, random access is not possible in linked lists as elements must be accessed sequentially. Each linked list node contains a data element and pointer to the next node.
![WHY LINKED LIST?
• Why Linked List?
Arrays can be used to store linear data of similar types, but arrays have the following limitations.
1) The size of the arrays is fixed: So we must know the upper limit on the number of elements in advance.
Also, generally, the allocated memory is equal to the upper limit irrespective of the usage.
2) Inserting a new element in an array of elements is expensive because the room has to be created for
the new elements and to create room existing elements have to be shifted.
• For example, in a system, if we maintain a sorted list of IDs in an array id[].
• id[] = [1000, 1010, 1050, 2000, 2040].
• And if we want to insert a new ID 1005, then to maintain the sorted order, we have to move all the
after 1000 (excluding 1000).
Deletion is also expensive with arrays until unless some special techniques are used. For example, to delete
1010 in id[], everything after 1010 has to be moved.
• Advantages over arrays
1) Dynamic size
2) Ease of insertion/deletion](https://image.slidesharecdn.com/datastructureday1-190916215321/85/Data-structure-day1-3-320.jpg)
Data structure day1
- 1. DATA STRUCTURE BY : M O H A M M E D E L S D O D Y
- 2. LINKED LIST INTRODUCTION • Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers.
- 3. WHY LINKED LIST? • Why Linked List? Arrays can be used to store linear data of similar types, but arrays have the following limitations. 1) The size of the arrays is fixed: So we must know the upper limit on the number of elements in advance. Also, generally, the allocated memory is equal to the upper limit irrespective of the usage. 2) Inserting a new element in an array of elements is expensive because the room has to be created for the new elements and to create room existing elements have to be shifted. • For example, in a system, if we maintain a sorted list of IDs in an array id[]. • id[] = [1000, 1010, 1050, 2000, 2040]. • And if we want to insert a new ID 1005, then to maintain the sorted order, we have to move all the after 1000 (excluding 1000). Deletion is also expensive with arrays until unless some special techniques are used. For example, to delete 1010 in id[], everything after 1010 has to be moved. • Advantages over arrays 1) Dynamic size 2) Ease of insertion/deletion
- 4. WHY LINKED LIST? • Drawbacks: 1) Random access is not allowed. We have to access elements sequentially starting from the first node. So we cannot do binary search with linked lists efficiently with its default implementation. about it here. 2) Extra memory space for a pointer is required with each element of the list. 3) Not cache friendly. Since array elements are contiguous locations, there is locality of reference which is not there in case of linked lists. • Representation: A linked list is represented by a pointer to the first node of the linked list. The first node is called the head. If the linked list is empty, then the value of the head is NULL. Each node in a list consists of at least two parts: 1) data 2) Pointer (Or Reference) to the next node In C, we can represent a node using structures. Below is an example of a linked list node with integer data. In Java or C#, LinkedList can be represented as a class and a Node as a separate class. The class contains a reference of Node class type.