Skip to main content

Insertion in a unordered LINKED LIST for Data Structure in 'C'

Insertion in a unordered LINKED LIST

Here in this case the NEW node is inserted after the location LOC. LOC is found by comparing the given Information with every node of the Linked List. For example consider the following Linked List. ROOT points to FIRST node with information 10. If a NEW node is to be inserted after a node with Information   20, 20 is given as Information.20 is compared with the information of first node, it is not equal, so it is compared with the second node it is equal hence address of second node is LOC. Now node is inserted by copying address of third node which is given by LINK of LOC, in the LINK field of NEW node and the LINK field of LOC is copied with the new node’s address given by NEW. So after the second node of the original list there comes the just inserted NEW node. When the Linked List is traversed after the second node there comes the new node as the third node. If the Information is printed it will be 10 20 15 5.

Algorithm to Insert node in unordered linked list:

            [IN is the information of the node after which insertion is done]
            If AVAIL =NULL Then:
               Write: ‘Memory Allocation Error’
            [End of If]
            [Information is the to be data stored in the NEW node]

             Repeat While IN< >LOC-->INFO AND LOC< >NULL
             [End of While]
             If LOC = NULL Then:
                Write: ‘Error in Insertion’
                [Error because node with IN is not present]
             [End of If]


Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video

Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:

      Suppose next node is allocated at an address 506, so the list becomes,

  Suppose next node is allocated with an address with an address 10,s the list become,

The other way to represent the linked list is as shown below:

 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …