Skip to main content

Insertion in an ordered LINKED LIST Data Structure in C programmong

Insertion in an ordered LINKED LIST

Here in this case to find the location LOC, the list is traversed, by comparing the Information to be stored with the information of the nodes. First compare the NEW node information with that of the information of the first node. If it is less then the first node information, insert the new node as the first node by copying the address of new node NEW in ROOT before that copy ROOT in LINK of NEW. So initially set LOC with LINK of ROOT and another pointer variable TEMP with ROOT. Traverse till LOC < >NULL or till the Information of the NEW node less than the Information of any node by updating TEMP with LOC and LOC with LINK of LOC. Once the location LOC is found, copy LOC, the address of the node before which insertion is to be done in LINK of NEW and copy address of the previous node given by LINK of TEMP with NEW.

    For example consider the below Linked List in which the node are stored in ascending order.


If a NEW node is to be inserted with Information 15, first create the NEW node and store the Information part of it with 15 and initialize LINK with NULL. Compare 15 with information of first node i.e. 10. 15 is not less than 10. So set LOC with LINK of ROOT and TEMP with ROOT. Compare INFO of NEW node with INFO of node pointer by LOC. So 15 is not greater than 20, come out LOC is the location at which the NEW node is to be inserted. Copy LINK of NEW with LOC and copy LINK of TEMP with NEW. Insertion is over.


Algorithm to Insert node in an ordered linked list when the location LOC is not given:

NSERTOLL(ROOT)
If AVAIL=NULL Then:
  write: ‘Memory Allocation Error’
  Exit.
[End of If]
NEW<--AVAIL
AVAIL<--AVAIL-->LINK
NEW-->LINK<--NULL
NEW-->INFO<--Information
[Information is the data to be stored in node]
If NEW-->INFO < ROOT-->INFO Then
NEW-->LINK<--ROOT
ROOT<--NEW
Else:
TEMP<--ROOT
LOC<--ROOT-->LINK
Repeat While LOC< >NULL AND NEW-->INFO > LOC-->INFO
  TEMP<--LOC, LOC<--LOC-->LINK
[End of While]
NEW-->LINK<--LOC
TEMP-->LINK<--NEW
[End of If]
Exit.

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 …