linked list insertion at head time complexity code example

Example: linked list insertion at beginning algorithm

Step 1. Create a new node and assign the address to any node say ptr.Step 2. OVERFLOW,IF(PTR = NULL)	   	write : OVERFLOW and EXIT.Step 3. ASSIGN INFO[PTR] = ITEMStep 4. IF(START = NULL) 	    	ASSIGN NEXT[PTR] = NULL       	 ELSE          	ASSIGN NEXT[PTR] = STARTStep 5. ASSIGN START = PTRStep 6. EXIT