Skip to main content

Operation on Linked List for Data Structure in C Language

Operation on Linked List

Traversing: To visit all the node of a linked list, start from the ROOT and visit first element and from the first element with the help of link field visit the second element, similarly visit all the element till the last node. The last node is recognized by a NULL address in it link field. So, set a pointer variable PTR with ROOT. Process PTRINFO and update PTR by LINK of PTR i.e. PTRPTRLINK. Repeat till the PTR is NULL. The algorithm is as follow:

                    TRAVERSELL(ROOT)
                    [ROOT points to first node’s address of Linked List]
                    PTR<--ROOT
                    Repeat While PTR< >NULL
                      Apply process to PTR-->INFO
                      PTR<--PTR-->LINK
                    [End of while]
                    Exit.
Algorithm to print the contents of a linked list:
                   TRAVERSELL(ROOT)
                   [ROOT points to first node’s address of Linked List]
                   PTR<--ROOT
                   Repeat While PTR< >NULL
                     Write: PTR-->INFO
                     PTR<--PTR-->LINK
                   [End of while]
                   Exit
Recursive Algorithm to traverse a linked list:
                   REC_TRAV (ROOT)
                   [ROOT points to first node’s address of Linked List]
                   IfROOT< >NULL
                      Apply process to PTR-->INFO
                      REC_TRAV(ROOT-->LINK)
                  [End of it]
                  Eixt.

Searching: Searching is nothing but finding a node with the given information for the presence. If it is present search is successful otherwise unsuccessful. Only Linear Search is used to apply the  searching. Searching almost resembles Traversing except that if search is successful traversing is terminated otherwise the linked list is traversed till the end.  

      So, in order to do searching, get the information to be searching and set PTR with ROOT. Compare Information with INFO of PTR, if it is equal ‘search is successful’ and terminate traversing otherwise update PTR with LINK and repeat the process. Continue the operation till the end. The end is recognized by a NULL of PTR.

Algorithm for Searching:
              SEARCHLL (ROOT, IN)
               [IN is Information to search in Linked List]
               PTR<--ROOT
               Repeat While PTR< >NULL AND IN< >PTR-->INFO
                 PTR<--PTR-->LINK
              [End of while]
              If PTR-->INFO=IN Then:
                Write: ‘Search Successful’
              Else:
                Write: ‘Search Unsuccessful’
             [End of If]
             Exit.

Insertion: Adding a new node the linked list is called as Insertion. To insert a node in the linked list, first a NEW node is created. To create a NEW node, memory is requested and the memory is allocated dynamically from free pool. So NEW is made point to AVAIL and AVAIL is updated. To insert a node two situations arise. The list may be a non-ordered or an ordered non-empty linked list.

If the Linked List is non-ordered list, to insert a NEW node, an Information of a node after which the insertion is to be made is given. So that Information is compared with every node of the list for equality, and the location LOC is found. After finding the LOC, LINK of LOC is copied to the LINK of NEW  node and LINK of NEW node and LINK of LOC is copied with NEW i.e.
NEW-->LINK<--LOC-->LINK and LOC-->LINK<--NEW.

If the Linked List is an ordered list, to insert a NEW node, the Information of NEW node is compared with   the Information of every node of the list. When the Information of the node of the list is greater, it is the     location LOC. The NEW  node is to be placed at that LOC.So in this case a TEMP variable is used to store the previous node’s address so that LINK of TEMP gives LOC. Now to insert the node, LINK of  NEW is copied with LOC and LINK of TEMP is copied with NEW. i.e.
 NEW-->LINK<--LOC and TEMP-->LINK<--NEW.

Comments

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 …