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

typedef struct buyInfo
{
char chem_name[41];
char chem_code[21];
long quantity;
long cost;
} buyInfo;

typedef struct invInfo
{
char chem_name[41];
char chem_code[21];
long quantity;
} invInfo;

typedef struct chemNode
{
invInfo data;
struct chemNode *left;
struct chemNode *right;
} chemNode;

typedef struct chemTree
{
double balance;
chemNode *root;
} chemTree;


int menu(chemTree *invTree,double bal);
chemTree* initInventory( char *invFileName, double bal, chemTree *invTree);
chemNode *insert(chemNode* Node,chemNode *head);
void free_tree(chemNode *head);
chemNode* newnode(char chem_name[41],char chem_code[21],long quantity,chemNode* left,chemNode* right)

void main()
{
int a;
chemTree*invtree=NULL;
double bal=0.0;

a=menu(invtree,bal);
getchar();
}
int menu(chemTree *invTree,double bal)
{	
	FILE*error=NULL;
	char newfile[200];
	char errfile[200];
	char invFileName[200],errFileName[200];
	char chem_name[41],chem_code[21];
	long quantity,cost;
	char choice=0;
	int x=1,saved=0,checker=0;

	while(x)
	{
		printf(MENU,bal);
		scanf("%1c",&choice);
		{
		switch(choice)
		{
			case'1':	
				{
					getchar();
				printf(FILE_NAME);
				scanf("%s",&newfile);
				printf("\n");
				printf(BALANCE);
				scanf("%lf",&bal);
				printf("\n");
				invTree=initInventory(newfile,bal,invTree);
		
				printf(ERROR);
				scanf("%s",&errfile);
				printf("\n");
				if(!(error))
					error= initErr(errfile, NULL);
				else
					{
					error= initErr(errfile, error);
					}
				break;
				}



chemTree* initInventory(char *invFileName,double bal, chemTree *invTree)
{
	
	chemNode*Node1;
	FILE*f1;
	int check;
	chemTree*thetree;
	long quant;
	char name[41],code[21];
	invInfo*inv;
	if(invTree)
	{
		free_tree(invTree->root);
	}
	invTree=(chemTree*)malloc (sizeof(chemTree));
	invTree->root=NULL;
	invTree->balance=bal;
	thetree=invTree;
f1=fopen(invFileName,"r");
if(!f1)
{
	printf(ERROR_OPEN);
	return NULL;
}
while(f1)
{
check=fscanf(f1,"%[^ ]%*c%[^ ]%*c%ld",&name,&code,&quant);
if(check==3)
{
Node1=newnode(name,code,quant,NULL,NULL);

inv=(invInfo*)malloc (sizeof(invInfo));
	strcpy(inv->chem_code,code);
	strcpy(inv->chem_name,name);
	inv->quantity=quant;
	thetree->root=insert(Node1,thetree->root);//ad[b]until here the tree is good//[/b]
}
else
{
	
	return ; 
}
}
}