Data structure ppt
This document discusses different data structures, focusing on linked lists. It defines a linked list as a collection of nodes that contain a data field and a link/address field. Linked lists are more flexible than arrays for insertion and deletion because they are not constrained to contiguous memory locations. The document describes four types of linked lists: singly linked lists, circular singly linked lists, doubly linked lists, and circular doubly linked lists. Singly linked lists contain a link to the next node, while doubly linked lists contain links to both the next and previous nodes. Circular lists have the last node link back to the first node.
Convert to study guideBETA
Transform any presentation into a summarized study guide, highlighting the most important points and key insights.
Data structure ppt
- 1. Presented By MD. TOFAZZAL HOSSAIN ID NO. 163015003 Department: CSE (Weekend)
- 2. Data structure is the way of organizing all data items in order that not only elements to be stored but also the relation between the elements DATA STRUCTURE
- 4. LINKED LIST What are the problems with Arrays - Size is fixed -Array Items are stored contiguously -Insertions and deletion at particular position is complex Why Linked list ? -Size is not fixed -Data can be stored at any place -Insertions and deletions are simple and faster
- 5. WHAT IS LINKED LIST? A linked list is a collection of nodes with various fields It contains data field and Address field or Link field Info field Link Field/ Address Field Pointer to the first node
- 6. LINKED LIST TYPES Singly Linked list Circular singly linked list Doubly linked lists Circular doubly linked lists
- 7. 10 1000 200015 NULL20 SINGLY LINKED LIST First
- 8. 10 1000 200015 400020 CIRCULARSINGLY LINKEDLIST Last node contains the address of the first node First
- 9. DOUBLY LINKED LIST Contains the address of previous node and next node NULL 10 15 202000 1000 2000 NULL3000 First
- 10. CIRCULAR DOUBLY LINKED LIST Contains the address of first node and last node 3000 10 15 202000 1000 2000 10003000 First
- 11. Thanks To ALL