Linked List In Data Structure | What Is Linked List? | Data Structures Tutorial | Simplilearn
This presentation is based on Linkedlist in Data Structures. This linkedlist in data structures tutorial will help the beginners with the major fundamentals of linkedlist, its different types and the operations involved in linkedlist. The video also covers practical demo for a better learning experience. 1. What is Linked list? 2. Why do we need Linked List? 3. Implementation of Linked List 4. Types of Linked List 5. Operations on Linked List 6. Benefits of Linked List 7. Limitations of Linked List What Is a Data Structure? The short answer is: a data structure is a specific means of organizing data in a system to access and use. The long answer is a data structure is a blend of data organization, management, retrieval, and storage, brought together into one format that allows efficient access and modification. It’s collecting data values, the relationships they share, and the applicable functions or operations. Why Is Data Structure Important? The digital world processes an increasing amount of data every year. According to Forbes, there are 2.5 quintillion bytes of data generated daily. The world created over 90 percent of the existing data in 2018 in the previous two years! The Internet of Things (IoT) is responsible for a significant part of this data explosion. Data structures are necessary to manage the massive amounts of generated data and a critical factor in boosting algorithm efficiency. Finally, since nearly all software applications use data structures and algorithms, your education path needs to include learning data structure and algorithms if you want a career as a data scientist or programmer. Interviewers want qualified candidates who understand how to use data structures and algorithms, so the more you know about the concepts, the more comfortably and confidently you will answer data structure interview questions. Learn more: https://www.simplilearn.com/data-structures-and-algorithms-article?utm_campaign=LinkedList&utm_medium=Description&utm_source=Slideshare
Recommended
Recommended
More Related Content
More from Simplilearn
More from Simplilearn (20)
Recently uploaded
Recently uploaded (20)
Linked List In Data Structure | What Is Linked List? | Data Structures Tutorial | Simplilearn
- 1. Linked List
- 2. Agenda
- 3. Agenda What is a Linked List? Why do we need Linked List? Implementation of Linked List Types of Linked List Operations on Linked List Benefits of Linked List Limitations of Linked List Key Take-aways
- 4. Linked List Click here to watch the video
- 5. What is a Linked List?
- 6. Linked list is linear data structure. Its elements can be traversed using pointers. Linked list is made up of nodes. Each node has 2 parts: What is a Linked List? Data add1 Data add2 Data add3 Data NULL START Head Tail Data Reference add1 add2 add3 1. Data 2. Reference to next node.
- 7. Why do we need Linked List?
- 8. Why do we need Linked List? Linked list is a linear Data structure like an array. • Array has fixed size, but Linked list can dynamically increase its size to overcome this limitation. • We can perform operations like insertion deletion with ease unlike array where we have to shift all the element after the operation.
- 9. Implementation of Linked List?
- 10. Types of Linked List
- 11. Types of Linked List Linked List Singly Doubly Circular Circular Doubly
- 12. Types of Linked List Doubly Singly Linked List Circular Circular Doubly
- 13. Types of Linked List Doubly Linked List Singly Circular Circular Doubly
- 14. Types of Linked List Circular Linked List Singly Doubly Circular Doubly
- 15. Types of Linked List Circular Doubly Linked List Singly Doubly Circular
- 16. Types of Linked List Linked List Singly Doubly Circular Circular Doubly
- 18. Singly Linked List 2 100 3 104 5 108 7 NULL START Head Tail 100 104 108 Singly linked list is a unidirectional linked list. We can only traverse it in one direction from head to tail.
- 20. Doubly Linked List Prev Data Next Node NULL 2 100 96 3 104 100 5 NULL START 96 100 104 The node of this linked list has one extra reference pointer called previous pointer. This pointer points to previous node. Doubly linked list is a bi-directional Linked list, we can traverse it in any direction
- 22. Circular Linked List 2 100 3 104 5 108 7 96 START Head Tail 100 104 108 96 Circular linked list is like a singly linked list but its last node points to first node. This is unidirectional linked list, so we can only traverse it in one direction.
- 23. Circular Doubly Linked List
- 24. Circular Doubly Linked List 104 2 100 96 3 104 100 5 96 START 96 100 104 It is a combination of circular and doubly linked list and circular linked list. It is a bidirectional linked list, so we can traverse this linked list in both direction.
- 25. Operations on Linked List
- 26. There are two operations we can perform on a linked list. • Deletion o At beginning o At last o At a specific position • Insertion o At beginning o At last o At a specific position Operations on Linked List
- 27. Insertion
- 28. At Beginning 2 100 3 104 5 108 7 NULL START 100 104 108 96 11 96
- 29. At Beginning 2 100 3 104 5 108 7 NULL 100 104 108 96 11 96
- 30. At the end 2 100 3 104 5 108 7 NULL START 100 104 108 96
- 31. At the end 2 100 3 104 5 108 7 112 START 100 104 108 96 11 NULL 112
- 32. At Specific Position 2 100 3 104 5 108 7 NULL START 100 104 108 96
- 33. At Specific Position 2 100 3 112 5 108 7 NULL START 100 104 108 11 104 112 96
- 34. Deletion
- 35. At Beginning 2 100 3 104 5 108 7 NULL START 100 104 108 96
- 36. At Beginning 2 NULL 3 104 5 108 7 NULL START 100 104 108 96
- 37. At the end 2 100 3 104 5 108 7 NULL START 100 104 108 96
- 38. At the end 2 100 3 104 5 NULL 7 NULL START 100 104 108 96
- 39. At Specific Position 2 100 3 104 5 108 7 NULL START 100 104 108 96
- 40. At Specific Position 2 100 3 108 5 108 7 NULL START 100 104 108 96
- 41. Benefits of Linked List
- 42. Benefits of Linked List It is a dynamic data structure. Insertion and Deletion is easier than in other linear data Structures. No Memory Wastage. Helpful in implementing different data structures like stack and queue.
- 43. Limitations of Linked List
- 44. Limitations of Linked List It takes a lot of memory to store data on node. Traversal is harder than other data structures Reverse traversing is easy in doubly linked list but it takes extra memory to store previous pointer
- 46. Final Key Take-aways Linked list is a dynamic data structure. Linked list are faster at insertion and deletion. Traversal is hard in linked list. Linked list is good at implementing other Data structures