/* Field definitions for competitor structure*/
typedef struct competitors
{
    char name[30];
    char address[100];
    char phone[20];

    int number;

    int river_ounces;
    int sea_ounces;
    int fly_ounces;

    struct competitors *left;
    struct competitors *right;

}data;

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

/*  This is a fisihing competition program designed
 *  @authour Tom Elliott
 *  @version 05/03/05
 *  This code is based on the example solution to assignment 2 written by Dave Price
 */



/* The main function executes the program */
main()
{
	int status = getInput();
};

/* The getInput function enables the program to ask the user for input
 *
 */

int getInput()
{
   char file_name[80]; /* No file name will be longer than 79 characters*/
   char temp[80];
   char *eof = "a"; /* will indicate the end of the file */


   FILE *nfile;

    printf("CI3370 Assignment 3\n\n ");
    printf("Please enter the name of the file you wish to open:");
    scanf("%s", &file_name);
    /* fopen takes two string arguments. The first is the name of the file the
     * second is the access character which in this case shows that the file is
     * being opened to be read
     */
    nfile = fopen(file_name, "r");


};

/*create the binary tree and add data */
    while (eof != NULL)
    {

        struct competitors *new_competitors;
        new_competitors = (struct competitors *) malloc (sizeof(struct competitors)); //NOTE TO SELF, THIS COULD CAUSE PROBLEMS !!!//
        /*set the left and right nodes to null*/
        new_competitors-> right = NULL;
        new_competitors-> left  = NULL;

        int stones, pounds, ounces;

        /*save the competitors name*/
        eof = fgets(temp, 80, nfile);

        if(eof == NULL)
	{
            /*IF here at end of file*/
            break;
        };

	strncpy(new_competitors-> name , temp, 30);

        /*save the competitors address*/
        fgets(temp, 80, nfile);
        strncpy(new_competitors-> address , temp, 100);

        /*save the competitors phone number*/
        fgets(temp, 80, nfile);
        strncpy(new_competitors-> phone_num , temp, 20);;

        /*save the competitors number*/
        new_competitors-> number = number;
        mumber++;

        /*save the competitors weights for the competition*/
        fgets(temp, 80, nfile);
        sscanf(temp, "%d %d %d", &stones, &pounds, &ounces);
        new_competitors-> riv_ounces = ounces(stones, pounds, ounces);

        fgets(temp, 80, nfile);
        sscanf(temp, "%d %d %d", &stones, &pounds, &ounces);
        new_competitors-> sea_weight = ounces(stones, pounds, ounces);

        fgets(temp, 80, nfile);
        sscanf(temp, "%d %d %d", &stones, &pounds, &ounces);
        new_competitors-> fly_weight = ounces(stones, pounds, ounces);


        insert(new_competitors);

};



/*used in the first run of entering the structures into the tree
  if there is no root, root is set to to_insert otherwise the function
  insert_node is called passing root in as next_node*/
void insert(struct competitors *insert)
{

    if(root == NULL)
    {
        root = insert;

    };
    else if (root != NULL)
    {

        insert(root, insert);
    };
};


/* allows for a node to be inserted into the tree*/
int insert(struct fisher *next, struct fisher *insert);
{

    int compare;
    compare = compareTo(node, insert);
    /*printf("test_in_func_insert_node\n");*/

    /* the node is already in there*/
    if(compare == 0)
    {
        printf("error added twice");
        return 0;
    };

    /* traversing the left sub tree*/
    if(compare == -1)
    {

        if((node-> left) != NULL)
	{
            insert(node -> left_, insert);
        };
        /*If the left sub tree is empty*/
        if((node-> left) == NULL)
	{
            node-> left = insert;
            return 1;
        };
    };

    /*traversing the right subtree*/
    if(compare == 1)
    {



        if((node-> right) != NULL)
	{

            insert(node-> right, insert);
        }

        /*IF the right sub tree is empty*/
        if(node-> right == NULL)
	{

            node-> right = insert;
            return 1;
        };
    };
};

/*create the binary tree and add data */
while (eof != NULL)

void insert(struct competitors *insert)
{

	if(root == NULL)
	{
		root = insert;

	}
	else if (root != NULL)
	{

		insert(root, insert);
	}
}