[mexx]

собственно долгое чтение манов и прочее помогли написать адекватный код
[PHP]
/*------------------TREE----------------------- */
#include <stdio.h>

typedef struct TNode
{
int Data;
struct TNode *right;
struct TNode *left;
} Tree;

Tree * InsertNode(Tree *Top, int tmp)
{
if (Top == NULL)
{
Top = (Tree *) malloc(sizeof(Tree));
Top->Data = tmp;
Top->left = NULL;
Top->right = NULL;
}
else
if (tmp < Top->Data)
Top->left = InsertNode(Top->left, tmp);
else
Top->right = InsertNode(Top->right, tmp);
return Top;
};

Tree * ReadFromFile(Tree * Head)
{
int tmp = 0;
FILE *f;
f = fopen("nums","r");
while (!feof(f))
{
fscanf(f, "%d\n", &tmp);
Head = InsertNode(Head, tmp);
};
return Head;
};

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

int main()
{
Tree *Root = NULL;
Root = ReadFromFile(Root);
PrintTree(Root);
return 0;
};

[/PHP]