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

typedef struct numtree {
    int val;
    struct numtree *left;
    struct numtree *right;
} numtree_t;

numtree_t *root, *node;

void makeTree(numtree_t *node1, int i) {
    node->val = i;
    if(root==NULL)
    {
        root = node;
        root->left = NULL;
        root->right = NULL;
    }
    else if(node->val <= root->val) makeTree(node->left, i);
    else if(node->val > root->val) makeTree(node->right, i);
}

void printTree(numtree_t *node1) {
    if(node1!=NULL)
    {
        printf("%d\n", node1->val);
        printTree(node1->left);
        printTree(node1->right);
    }
}

int main() {
    int num, i;
    root = NULL;

    //printf("Enter number of inputs: ");
    //scanf("%d", &num); getchar;

    for(i=1; i<=10; i++)
    {
        node = (numtree_t*) malloc(sizeof(numtree_t));

        //printf("Input number: ");
        //scanf("%d", &node->val); getchar;
        makeTree(node, i);
    }

    numtree_t *node1 = root;
    printTree(node1);
    return 0;
}