LinkedList in data structure in engineering.pptx

LinkedList

1. LINKED LIST & IT’S TYPES NAME-: Rudra Prasad REG.NO.-:220301120187

2. AGENDA What is linked list? Types of linked list? Advantages and disadvantages. Real world applications Conclusion.

3. What is linked list ? A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers.

4. Types of linked list? Singly Linked List. Doubly linked lists. Circular linked lists. Circular doubly linked lists.

5. Singly Linked List. A  singly linked list  is a linear data structure in which the elements are not stored in contiguous memory locations and each element is connected only to its next element using a pointer.

6. Doubly linked lists .   A doubly linked list or a two-way linked list is a more complex type of linked list that contains a pointer to the next as well as the previous node in sequence, Therefore, it contains three parts of data, a pointer to the next node, and a pointer to the previous node. This would enable us to traverse the list in the backward direction as well.

7. Circular linked lists . The  circular linked list  is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.

8. Circular doubly linked lists . A  circular doubly linked list  is defined as a  circular linked list   in which each node has two links connecting it to the previous node and the next node.

9. Advantages and disadvantages Dynamic size accommodation Efficient insertions and deletions Flexible memory allocation Versatility for various implementations Advantages Disadvantages Inefficient memory usage due to pointer overhead Lack of direct access Increased memory overhead Less efficient reverse traversing

10. Real world applications Linked lists find application in various real-world scenarios, such as browser history, music playlists, and to-do lists in productivity applications. They are used in file systems to manage files, in networking for managing connected devices, and in image processing applications for handling pixel data efficiently. Additionally, they are fundamental in implementing queue and stack data structures .

11. Conclusion Linked lists are dynamic data structures with nodes linked by pointers. Types include singly, doubly, and circular lists. They facilitate efficient insertions and deletions, but may require more memory.

12. THANK YOU!