/*My node looks like this.Pretty simple huh??*/
struct node
{
	char *data;
	struct node *next;
};

/*Initialize head record before main()*/
struct node *first_rec=NULL;

/*I am passing to arguments while calling my function.
Arg word holds my actual word i want to insert and arg where
hold the record before which I want to insert my word*/

int insert_record(char *word,char *where)
{
	struct node *cur_ptr;    //to hold the current record to work on
	struct node *new_rec;  //create a new node to insert
	struct node *prev;       //hold the record before inserted record to modify its next pointer
	
	int result;
	/*Allocate memory for new record to be inserted*/
	new_rec=(struct node *)malloc(sizeof(struct node));
	/*Allocated the memory for word in new record*/
            new_rec->data = (char *)malloc( (strlen(word) + 1) * sizeof(char));
	
             /*Save the data in the data portion of the node*/
	strcpy(new_rec->data,word);

	/*load the first or head record in current pointer for processing*/
             cur_ptr=first_rec;

	/*Loop till we hit the end of the list (i.e NULL pointer)*/
            while (cur_ptr!=NULL)
	{
		/*Check if the current data matches the where data if yes then you need to insert before this record*/
                          if ((strcmp(cur_ptr->data,where))== 0)
		{
			if (cur_ptr==first_rec)
					{
						/*Here we are Inserting before 1st record which needs updating our head pointer*/
						first_rec=new_rec;
						first_rec->next=cur_ptr;
						result=1;
						return result;
					}
					/*Here we are Inserting before current record which is regular processing*/
					prev->next=new_rec;
					new_rec->next=cur_ptr;
					result=1;
					return result;
					
		}
		prev=cur_ptr; //If no hit to where data in the loop save the current node ptr in node "prev" we will need it in next interation
		cur_ptr=cur_ptr->next; //Increment the cur_ptr to point to next node in the list.
		continue;
	}
	if (cur_ptr==NULL)
	{
		result=2;
		return result;
	}
}