#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, *node1;

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

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

    }
}

int main() {
    int num, i;
    root = NULL;
    //printf("Enter number of inputs: ");
    //scanf("%d", &num); getchar;

    for(i=1; i<=10; i++)
    {
        //printf("Input number: ");
        //scanf("%d", &node->val); getchar;
        makeTree(node1, i);
    }

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