typedef struct element{
	<type> data; //not sure of type
	struct element *next;
} LIST;

LIST *head=NULL;

string word;
puts ("Enter a word");
scanf ("%80s", &word);

 if ( strlen(tempword)<=0 || strlen(tempword)>80)
 {
   print error..do something..and exit program or ask for word again.
   
 } else if {(strcasecmp(tempword,"quit"))==0)  /* word entered is quit */
  {
    exit program or do something....
  }

#include <stdio.h>
#include <string.h>

typedef struct element {

	char *data;
	struct element *next;

}LIST;

LIST *head=NULL;

void main (void) {

	char word[81];
	char end[5]="QUIT";

	void InsertIntoList(char *new) {

		char *new=malloc(sizeof(word));

		strcpy (new, word);

		if (*head=NULL) {

		head=malloc(sizeof(LIST));
		head->data=new;
		head->next=NULL;
	}

LIST *current=head;
LIST *previous=head;
LIST *new_node;
new_node->data=*new;
new_node->next=NULL;


while (strcmp (*new, *current)<0) {

	if ((current->next)=NULL) { 

	current=new_node; 

// I don't know how to change the pointers to add a new element
// Or how to change the previous pointer to point at the new element
//Or how to change the pointer of the new element to point at the next 
//element
// I don't even know how to reference any of the elements of the list other 
// than head!
// Can't seem to figure out how I would go about manipulating this list in any 
// way

boolean stringcmp(char *str1,char *str2)
{
	int str1len,str2len;
	int min,i;
	str1len=strlen(str1);
	str2len=strlen(str2);
    
	min=(str1len<str2len)? str1len : str2len;
	
	i=0;

	while (i<min)
	{
		if (str1[i]<str2[i])
		{
			return TRUE;   //String 1 preceeds String 2
		} else if (str2[i]<str1[i])
		{
			return FALSE;  ////String 2 preceeds String 1
		} else {
			i++;
		}
	}
	/* If both strings are the lexicographically similar till the last character compared then smaller one in length preceeds in length*/
    if (str1len<str2len)
    {
		return TRUE;
    } else if (str2len<str1len)
    {
		return FALSE;
    } 
}

typedef enum {
	FALSE,
	TRUE
} boolean;

function addtolist (word)

{
 allocate memory for new node
 allocate memory for data in new node of the size word
 save the word in new node->data
 point new node->next to NULL

 if list is empty then
 make new node as head node
 make head node as the last added node
 else 
 get the last added node
 compare last node ->data with  new node->data (lexicographical order)
     if new node->data preceeds last node -> data then 
          point last node ->next to new node
          swap last node ->data with new node ->data
          make new node as the last added node
    else 
         point last node ->next to new node
         make new node as the last added node

}