algorithm for inserting a node in a linked list精要.docVIP

Memory Allocation: Static – the size/space is allocated altogether in one location in a sequence for the data in advance and cannot be changed once allocated. Example : Array Dynamic - the size/space is allocated randomly from anywhere in the memory for the data as and when needed so it can be changed easily. Example : Linked lists Types of Linked Lists: Singly Linked lists (SLL ) – only one link from one node to another Doubly Linked lists ( DLL)– two links between 2 nodes Circular Linked Lists ( CLL) – last node points to the first node Operations that can be performed on a Singly Linked list: Insert/Add a new node in the list in the beginning of the list at the end of the list in between 2 nodes of the list Delete/Remove a node from the list from the beginning of the list from the end of the list from between 2 nodes of the list Traverse (read and display the values) the nodes in the list Algorithm for Inserting a node in an empty list: (inserting the 1st node) Start = null // there is no node in the list Create newnode //allocate memory for the data to be inserted newnode.data=data // store the value in the data field of the newnode start=newnode // make start point to the first node newnode.next=null // there is no node after this node Algorithm for Inserting a node at the end of a list that already has one or more nodes: if Start is not NULL // there is at least one node present in the list current =start // create a copy of start which is used to locate the last node so that we don’t lose the first node Repeat current = current.next until current.next=null // (the pointer is moved from one node to another in order to find the last node) current.next=newnode // insert the newnode after the last node newnode.next=null // newnode is the last node Algorithm for Inserting a node in an empty list using LAST: (inserting the 1st node) start = null last = null // there is no node or the list does not exist create newnode newnode.data=data start=newnode last=