code for binary tree creation and traversal(preorder)

binarytree.c

#include<stdio.h>
#include<malloc.h>
struct bt
{
    int data;
    struct bt *left;
    struct bt *right;
};

struct bt* create(struct bt *h)
{
    struct bt *p,*q;
    int side,y=1;
    h=(struct bt *)malloc(sizeof(struct bt));
    scanf("%d",&h->data);
    h->left=NULL;
    h->right=NULL;
    while(y) {
            p=h;
            struct bt *t=(struct bt *)malloc(sizeof(struct bt));
            printf("enter value to be added ");
            scanf("%d",&t->data);
            t->left=NULL;
            t->right=NULL;
            while(p!=NULL){
                        q=p;
                        printf("enter side");
                        scanf("%d",&side);
                        if(side==1){
                            p=p->left;
                        }
                        else{
                             p=p->right;
                        }        
            }
            if(side==1){
            q->left=t;
            }
        else{
            q->right=t;
        }
    printf("1 to cont: ");
    scanf("%d",&y);
    }
    return h;
}

void pre(struct bt *h)
{
    while(h!=NULL){
        printf("%d",h->data);
        pre(h->left);
        pre(h->right);
    }
}

void main()
{
    struct bt *head;
    head=create(head);
    pre(head);
}