#include "stdafx.h"
#include "stdio.h"
#include<iostream>
#include "stdlib.h"
#include "time.h"

using namespace std;

struct treeNode
{
    struct treeNode *leftPtr;
    int data;
    struct treeNode *rightPtr;
};
typedef struct treeNode TREENODE;
typedef TREENODE *TREENODEPTR;



int main(array<System::String ^> ^args)
{
    FILE *file;
    if ((file = fopen("GGG.txt","w")) == NULL)
        {
            printf("The file can not be opened\n");
            exit(0);
        }
    else
        {
            srand((unsigned int)time(NULL));
            int *a = new int[100](); 
            for ( unsigned int i = 0; i < 100; i++)
                {
                    a[i] = rand();                            
                    fprintf (file, " %d\n\n" , a[i]); 
//----------------------------------------------------------------------------------------------
                    fscanf(file, "%d", a[i]);
                    //void insertNode(TREENODEPTR *,int);
                    void print_Tree(Tree * p,int level)
//-------------------------------------------------------------------------------------------
            delete [] a;
        }
    fclose(file);
    system("PAUSE");
    return 0;
}
/*
void insertNode(TREENODEPTR *treePtr, int value)
{
    if (*treePtr==NULL)
    {
    //    *treePtr = malloc (sizeof(TREENODE));
        if (*treePtr != NULL)
    {
        (*treePtr) ->data = value;
        (*treePtr) ->leftPtr = NULL;
        (*treePtr) ->rightPtr = NULL;
    }
    else
        printf("%d NO NO NO!!!\n", value);
    }
    else 
        if (value < (*treePtr) -> data)
            insertNode(&((*treePtr) -> leftPtr), value);
        else
            if (value > (*treePtr) -> data)
            insertNode(&((*treePtr) -> rightPtr), value);
            else
                printf("dup");
}
*/

void print_Tree(Tree * p,int level)
{
    FILE *file = fopen("GGG.txt","r");

    if(p)
    {
        print_Tree(p->left,level + 1);
        for(int i = 0;i< level;i++) cout<<"   ";
        cout << p->key << endl;
        print_Tree(p->right,level + 1);
    }
}