/*
   This is the header file 
*/

/* Field definitions for competitor structure*/
typedef struct competitor
{
    char name[80];
    char address[100];
    char phone[30];
    int comp_number;
    int river_ounces;
    int sea_ounces;
    int fly_ounces;
} data;[/quote]

#include <stdio.h>
#include "fishing.h"

main()
{

    FILE * competition;
    char oneword[79], filename[20];
    char *c;

    /* Prompt user to enter filename */
    printf("Please enter name of file \n\n");
    scanf("%s", filename);

    /* Open file */
    competition = fopen(filename, "r");

    /* If fopen() fails it returns a NULL pointer so 
    this must always be checked for when opening a file */
    if (competition == NULL)
    {
       printf("Error opening file\n");
       exit(1);
    }

	else
		{
			do
			{
            /* Reads one line from the file at a time */
				c=fgets(oneword, 79, competition);


				if (c != NULL)
            /* Display file */
				printf ("%s", oneword);
			}

			while (c != NULL); /* Repeat until there are no more lines to read from */
		}


		fclose(competition);
}

struct node{
  //data as needed
  struct node* left;
  struct node* right;
};

  struct node* root;
  root = 0;

struct node* new_node = (struct node*) malloc(sizeof(struct  node) );
strcpy(new_node->name,word);
// and so on...
new_node->left = 0;    //Set left and right branches as null on all new nodes.
new_node->right = 0;
root = insert_node(root, new_node);  //Return the root just in case it changes.

struct node* insert_node(struct node* root, struct node* new_node)
{
  struct node* current;
  int compare;

  if(!root)
    root = new_node;   //Tree was empty this will be the start.
  else{
    current = root;
    while(1){
       compare = strcmp(current->name,new_node->name);
       if(compare < 0 ){
          if(current->left)
             current = current->left;
          else{
             current->left = new_node;
             break;
          }
      }
      if(compare > 0 ){
            //Similar to left, just use right
      }
    }
  }
  return root;
}