Singly Linked List
Download as PPTX, PDF0 likes152 views
A linked list is a linear data structure composed of nodes, where each node contains data and a pointer to the next node. There are three types of linked lists: singly linked lists where each node points to the next but not the previous; doubly linked lists where each node points to both the next and previous node; and circular linked lists where the last node loops back to the first node. Basic operations on linked lists include inserting and deleting nodes at the beginning or end of the list, and adding nodes after a specified element.
Related topics:1 of 15
Download to read offline
More Related Content
What's hot (20)
Ad
Similar to Singly Linked List (20)
Ad
Recently uploaded (20)
Singly Linked List
- 2. Linked List is a linear data structure and it is very common data structure which consists of group of nodes in a sequence which is divided in two parts. Each node consists of its own data and the address of the next node and forms a chain. Linked Lists are used to create trees and graphs.
- 3. There are three common types of Linked List: • Singly Linked List • Doubly Linked List • Circular Linked List
- 4. Singly linked lists contain nodes which have a data part as well as an address part i.e. next, which points to the next node in sequence of nodes. The operations we can perform on singly linked lists are insertion, deletion and traversal.
- 5. Following are the basic operations supported by a list. − Adds an element at the beginning of the list. − Deletes an element at the beginning of the list. − Adds an element at the end of the list. − Deletes an element from the end of the list. − Adds an element after an item of the list.