#include <stdio.h>
typedef struct node
{
int data;
struct node *left;
struct node *right;
}node;
void print(node *p)
{
if(p!=NULL)
{
print(p->left);
printf("%d/n",p->data);
print(p->right);
}
}
void main()
{
int n;
node *head,*f,*p,*q;
scanf("%d",&n);
head=(node *)malloc(sizeof(node));
head->data =n;
head->left =NULL;
head->right =NULL;
scanf("%d",&n);
while(n!=-1)
{
p=(node *)malloc(sizeof(node));
p->data =n;
p->left=NULL;
p->right =NULL;
q=head;
f=q;
while(q!=NULL)
{
if(n<q->data )
{
f=q;
q=q->left ;
continue;
}
if(n>q->data )
{
f=q;
q=q->right ;
continue;
}
}
if(n<f->data ) f->left =p;
if(n>f->data ) f->right =p;
scanf("%d",&n);
}
print(head);
}