/*------------------TREE----------------------- */
#include <stdio.h>
typedef struct TNode
{
	int Data;
	struct TNode *right;
	struct TNode *left;
} Tree;

Tree *Root = NULL;

void ReadFromFile(Tree *Top)
{
	int tmp = 0;
	FILE *f;
	f = fopen("nums","r");
	
	if (Top == NULL)
	{
		fscanf(f, "%d\n", &tmp);
		Top = (Tree*) malloc(sizeof(Tree));
		Top->Data = tmp;
		Top->left = NULL;
		Top->right = NULL;
	};
	while (!feof(f))
	{
		fscanf(f, "%d\n", &tmp);
		InsertNode(Top, tmp);
	};	
};

void PrintTree(Tree *Top)
{
	printf("%d", Top->Data);
	if (Top->left != NULL)
		PrintTree(Top->left);
	if (Top->right != NULL)
		PrintTree(Top->right);	
};

void InsertNode(Tree *p, int i)
{
	if ( i < p->Data )
		if ( p->left == NULL )
		{
			p->left = (Tree*) malloc(sizeof(Tree));
			p->left->Data = i;
			p->left->left = p->left->right = NULL;
		}
		else
			InsertNode(p->left, i);
	else 
		if ( i > p->Data)
			if ( p->right == NULL )
			{
				p->right = (Tree*) malloc(sizeof(Tree));
				p->right->Data = i;
				p->right->left = p->right->left = NULL;
			}
			else
				InsertNode(p->right, i);

//	free(p->right);
//	free(p->left);
};

int main()
{
	ReadFromFile(Root);
//	PrintTree(Root);
	if ( Root == NULL)
		printf("%d\n", 123);
	return 0;
};