Linked list
- 2. SINGLE LINKED LIST Single linked list is a sequence of elements in which every element has link to its next element in the sequence.
- 3. In any single linked list, the individual element is called as “Node”. Every “Node” contains two fields, data and next. The data fields is used to store actual value of that node and next field is used to store the address of the next node in the sequence. Stores actual value Stores address of next node LinkData
- 4. In a single linked list, the address of the first node is always stored in reference node known as “front” it is also known as “head”. Always next part of the last node be NULL. Example:
- 5. Insertion: In a single linked list, the insertion operation can be performed in three ways. They are as follows… Inserting at beginning of the list Inserting at End of the list Inserting at specific location in the list
- 6. Deletion: A In a single linked list, the deletion operation can be performed in three ways. They are as follows… Deletion from Beginning of the list Deletion from End of the list Deletion a Specific Node
- 7. Displaying a single linked list: To display the elements of a single linked list… Check whether list is empty If it is empty then, display ‘List is Empty’ If it is Not Empty then, define a Node pointer ‘temp’ and initialize with head Finally display temp data with arrow pointing to Null (temp data ---> Null).
- 8. Doubly linked list Doubly linked list is a sequence of elements in which every element has links to its previous element and next element in the sequence.
- 9. In double linked list, every node has link to its previous node and next node. So, we can traverse forward by using next field and can traverse backward by using previous field Every node in a double linked list contains three fields and they are shown in the following figure…
- 10. Link 1, field is used to store the address of the previous node in the sequence, link 2 field is used to store the address of the node in the sequence and ‘DATA’ field is used to store the actual value of that node. Example:
- 11. In doubly linked list, the first node must be always pointer by head. Always the previous field of the first node must be Null. Always the next field of the last node must be Null. In a doubly linked list, we perform the following operations... 1. Insertion 2. Deletion 3. Display
- 12. Insertion: In a doubly linked list, the insertion operation can be performed in three ways as follows… Inserting at beginning of the list Insertion at end of the list Inserting at specific location
- 13. Deletion: In a doubly linked list, the deletion operation can be performed in three ways as follows… Deletion from beginning of the list Deletion from end of the list Deletion a specific node
- 14. Displaying a doubly linked list: We can use the following steps to display the elements of a double linked list… Check whether list is Empty If it is Empty, then display ‘list is empty’ and terminate the function If it is not Empty, then define a Node pointer ‘temp’ and initialize with head Finally, display temp data with arrow pointing to Null (temp data ---> Null).
- 15. Applications of linked list Linked list are frequently used to implement other data structures such as trees, graphs and heaps. Linked list are useful for creating dynamic stacks and queue with can grow or shrink at run time. Linked list can be used to store and process polynomial.
- 16. Efficient memory utilization that is not pre allocated memory allocated. When ever it is required and is de allocated when it is not longer required. Insertion and deletion are easier and efficient Many complex applications can be easily handle with link list.