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 li