Algorithm for Insert a node at the End of a Linked List

ALGORITHM NAME: INSERT_BEGIN_LL(START,D)

1.start

2.Create a node and store its starting address to temp

3.If temp=NULL

                1.print Insertion is not Possible

                2.Exit

4.End if

5.temp->data=d

6.temp->link=NULL

7.if strat=NULL

                1.start=NULL

                2.Exit

8.End if

9.e=start

10.while e->link!=NULL,do

                1.e=e->link

11.End while

12.e->link=temp

13.stop