Representation of Linear Linked List
Suppose we want to store list of integer number then the linear linked list can be represented in memory with the following declarations.
Struct node
{
Int a;
Struct node *next;
}
Tepedef struct node NODE;
NODE *start;
The above declaration defines a new type whose each element is of type node_type and gives it a name node.
Operation on linked list
The basic operations to be performed on the linked lists are as follows;
1. Creation
2. Insertion
3. Deletion
4. Traversing
5. Searching
6. Concatenation
7. Display
Let us define this terminology before applying them to any of the four types of Inked lists.
Creation
This operation is used to create a linked list. Here the constituent node is created as and when it is required and linked to the list to preserve the integrity of the list.
Insertion
This operation is used to insert a new node in the linked list at the specified position. A new node may be inserted
At the beginning of a linked list
At the end of a linked list
At the specified position in a linked list
If the list itself is empty, then the new node is inserted as a first node.
Deletion
This operation is used to delete an item (a node) from the linked list. A node may be deleted from the
Beginning of a linked list
End of a linked list
Specified position in the list
Traversing
It is a process of going through all the nodes of a linked list from one end to the other end. If we start traversing from the very first node towards the last node, it is called forward traversing if the desired element is found we signal operation "SUCCESSFUL" Otherwise, we signal it as "UNSUCCESSFULL"
Concatenation
If is the process of appending (joining) the second list to the end of the first list consisting of m nodes. When we concatenate two lists, the second list has n nodes then the concatenated list will be having (m+n) nodes. The last node of the list is modified so that it is now pointing to the first node in the second list.
Display
This operation is used to print each and every nod's information. We access each node from the beginning (or the specified position) of the list and output the data housed there.
You will be studying the algorithms for each of this basic operation in the successive sections.
Data Structure & Algorithms Assignment Help, Live Experts
Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.
ExpertsMind.com - Linear Linked List Assignment Help, Linear Linked List Homework Help, Linear Linked List Assignment Tutors, Linear Linked List Solutions, Linear Linked List Answers, Linked Lists Assignment Tutors