Insertion of element into a linked list, Data Structure & Algorithms

Assignment Help:

ALGORITHM (Insertion of element into a linked list)

Step 1 Begin the program

Step 2 if the list is empty or any new element comes before the start (head) element, then add the new element as a start element.

Step 3 else, if the new element comes after the last element, then add the new element as the end element.

Step 4 else, add the new element in the list using the determinefunction,determine function returns the address of the found element to the insert_list function.

Step 5 End.

Figure demonstrated the scenario of a linked list of two elements & a new element that has to be inserted between them. Figure demonstrate the scenario of a linked list after insertion of any new element into the linked list of Figure.

Before insertion

2379_Insertion of element into a linked list.png

Figure: A linked list of two elements & an element that is to be inserted

After insertion

1950_Insertion of element into a linked list1.png

Figure: Insertion of a new element into linked list

Program demonstrated the code for the insertion of any element into linked list by searching for the position of insertion alongwith the help of a find function.


Related Discussions:- Insertion of element into a linked list

What do you understand by tree traversal, What do you understand by tree tr...

What do you understand by tree traversal? The algorithm walks by the tree data structure and performs some computation at everynode in the tree. This process of walking by the

frequenty count of function, Ask question find frequency count of function...

Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }

Binary search tree, write an algorithm to delete an element x from binary...

write an algorithm to delete an element x from binary search with time complex

Explain critical path and chain, 1.  Using the traditional method of CPM: ...

1.  Using the traditional method of CPM: a.  What activities are on the critical path? b.  What is the expected total lead time of the project? 2.  Using CCPM: a.  What

Hashing, what is hashing? what are diffrent method of hashing?

what is hashing? what are diffrent method of hashing?

What is solid modeling, What is Solid modeling Solid modeling is the mo...

What is Solid modeling Solid modeling is the most powerful of the 3-D modeling technique. It provides the user with complete information about the model. Defining an object wit

How many nodes in a tree have no ancestor, How many nodes in a tree have no...

How many nodes in a tree have no ancestors 1 node in atree have no ancestors.

Which are the two standard ways of traversing a graph, Which are the two st...

Which are the two standard ways of traversing a graph? i. The depth-first traversal   ii. The breadth-first traversal

Postorder traversal of a binary tree, Postorder traversal of a binary tree ...

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

Implementation of queue, For a queue a physical analogy is a line at bookin...

For a queue a physical analogy is a line at booking counter. At booking counter, customers go to the rear (end) of the line & customers are attended to several services from the fr

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd