Link List ALGORITHM FOR INSERTING A NODE
Download as PPTX, PDF0 likes4 views
The document outlines algorithms for inserting a node in a linked list at various positions: at the beginning, at the end, and at a specified position. It includes steps for creating a new node, updating pointers, and handling cases where the list is empty. Additionally, it specifies that position '0' for insertion is not allowed.
Link List ALGORITHM FOR INSERTING A NODE
- 1. ALGORITHM FOR INSERTING A NODE Suppose • START is the first position in linked list. • VALUE be the element to be inserted in the new node. •POS is the position where the new node is to be inserted. • TEMP is a temporary pointer to hold the node address. 13
- 2. ALGORITHM FOR INSERTING A NODE Insert a Node at the beginning 1.Input VALUE to be inserted 2.Create a NewNode 3.NewNode -> DATA = VALUE 4.NewNode -> Next = START 5.START = NewNode 6.Exit 14
- 3. ALGORITHM FOR INSERTING A NODE Insert a Node at the end 1.Input VALUE to be inserted 2.Create a NewNode 3.NewNode -> DATA = VALUE 4.NewNode -> Next = NULL 8.If (SATRT equal to NULL) START = NewNode 9.Else (a)TEMP = START (b)While (TEMP -> Next not equal to NULL) TEMP = TEMP -> Next 15
- 4. ALGORITHM FOR INSERTING A NODE Insert a Node at any specified position (POS=1 means insert after first node. POS=0 not allowed) 1.Input VALUE and POS to be inserted 2.initialize TEMP = START 3.Repeat until POS TEMP = TEMP Next 4.Create a New Node 5.NewNode -> DATA = VALUE 6.NewNode -> Next = TEMP -> Next 7.TEMP -> Next = NewNode 8.Exit 16