linked list algorithm


Step1  [start = null ]

Step2 [allocate space for newly created node ]

             Node  =  create a null

Step3 [assign value to information part of a node ]

            Info[node] = value

Step4 [ assign null  to  the  address part of the end of the list ]

                        Next of node  = null

Step5 [ assign address of the 1st node to start variable ]

                        Start  = n

Step6 [exit]