Oops, first time sorry about this

Code:
****************SEARCH.C FILE:***************/

#include "search.h"

/*gcc -ansi -Wall -pedantic -o wordsearch search.c*/
 
int main(int argc, char **argv){

 char *word[30];
 int i;
 int j;
 int k;
 int t;
 FILE *songs;
 char str[3000];
/*  BSTWort *root = new BSTWord;
 */
/*  open file */
 songs = fopen(argv[1], "r");

 printf("\nPlease be patient while list is populated...\n");

  i=0;
 /*  while each line is not empty... */
  while(fgets(str, 3000, songs)!=NULL)
   {
   /* dynamically allocate pointer in matrix[i] with the size of int */
	t=0;

	for(k=0; k<strlen(str);k++)
	{
	 if (str[k-1] == ' ')
	 /*prevent double spacing related errors*/
	 if(str[k] != ' ')
	 t++;
	}
	
	 for(j=0;j<(t+1);j++)/*just for each row*/
	  {
	   if(j==0) /* if first word */
          {
		   strcpy(word, strtok( str, delims ));
		   /*  string tokenise line between spaces*/
		   insertWord(word, i+1, j+1);
          }
	  else
	      {
		   strcpy(word, strtok( NULL, delims ));
		   insertWord(word, i+1, j+1);
	      }
 	  }
	 
	i++;
   }
   
   current=root;
  while(current)
  {
  printf("%s\n", current);
  current = current->right;
  }

    printf("%s", root->word);
    printf("\n%i words successfully inserted into tree!\n\n", count); 
   
    wordsearch();
   
 return EXIT_SUCCESS;
 }
 
 

int insertWord(char *inword, int songnum, int wordnum)
   {

if( (newNode=malloc(sizeof(WordType))) == NULL)
	{
		fprintf(stderr, "\nMemory Allocation for ListInsert failed!\n");
		fprintf(stderr, "\nAborting data entry!\n");
		exit(1);
	} 
	
	strcpy(newNode->word, inword);
	newNode->songnumber = songnum;
	newNode->wordnumber = wordnum;
	newNode->checked = 0;
	newNode->left = NULL;
	newNode->right = NULL;
	
   if (root == NULL)
    {
        root = newNode;
		count++;
        success = 1;        
        printf("root word: %s\n",root->word);
    }
    else if (root->word == inword)
    {
        return 0;
    }
    else
    {
        success = InsertIntoSubTree(*root, *newNode);
    }
     

	
    return success;
}

/* Insert into the BST sub branch */

int InsertIntoSubTree(WordType parent, WordType current)
{
    int success = 0;
    int i;
	
     if (strcmp(current.word, parent.word)<0)
     {
      printf("less than root...");
	  
	  if(parent.left != NULL)
	  {
	   success = InsertIntoSubTree(*parent.left, current);
	  }
	  else
	  {
	  parent.left = &current;
	  printf("%s", parent.left);
	  count++;
	  printf("%s inserted to left of %s\n", current.word, parent.word);
	  }
	 }
	 else if(strcmp(current.word, parent.word)>0)
	 {
      printf("greater than root...");
	  
	  if(parent.right != NULL)
	  {
	   success = InsertIntoSubTree(*parent.right, current);
	  }
	  else
	  {
	  parent.right = &current;
	  count++;
	  printf("%s inserted to right of %s\n", current.word, parent.word);
	  }
	 }
	 else
	 {
	  printf("same as root\n");
	 }

    return success;
}

void wordsearch()
{
   int pass=0;
   int i=0;

  while(pass==0)
  {
    char qword[70];
    printf("Enter a query: \n");
    fgets(qword, 80, stdin);

       for(i=0;i<strlen(qword);i++)
             {
               if ( qword[i] == '\n' )
                 {
                   qword[i] = '\0';
                   break;
                 }
             } 

/*        else if((strlen(qword) < 2) || (strlen(qword) > 26))
	      {
           if(strlen(qword) == 1)
		     {
           printf("Exiting...\n\n");
             }
		  fprintf(stderr, "Please enter between 1 and 25 characters...\n");
          } */
    
	
     if(*qword=='0')
	 {
	 printf("Exiting...\n\n");
	 pass=1;
	 }
	 else
	 {
/* 	 printf("%s", qword); */
	 printf("Song  Positions\n");
/* 	 findword(root, qword);
 */	 }
	 
    }
  }