#include<stdio.h>
struct node
{
	struct node *left;
	int value;
	struct node *right;
};

void create_tree(struct node *node_ptr, struct node *new_node)
{
	if(node_ptr== NULL)
		node_ptr= new_node;
	else if (new_node->value <= node_ptr->value)
		create_tree(node_ptr->left , new_node);
	else if((new_node->value) > (node_ptr->value))
		create_tree(node_ptr->right,new_node);
}

void preorder(struct node *node_ptr)
{
  printf("%d",node_ptr->value);
  if(node_ptr->left!=NULL)
	preorder(node_ptr->left);

  if(node_ptr->right!=NULL)
	preorder(node_ptr->right);
}

int main()
{
   int i=1;
   char choice='y';
   struct node *root=NULL;

   struct node *new_node=(struct node*)malloc(sizeof(struct node));
   new_node->left=new_node->right=NULL;

   printf("\n Enter the value of the %d first node",i);
   scanf("%d",&new_node->value); 
   root=new_node;
/* first node is filled and taken as the root node*/
 
printf("\nDo you want to create more nodes");
	scanf("%c",&choice);     
while((choice=='y')||(choice=='Y'))
{
        i=i+1;

        new_node=(struct node*)malloc(sizeof(struct node));
        new_node->left=new_node->right=NULL;

        printf("\n Enter the value of the",i," %d th node");
	scanf("%d",&new_node->value);      
        create_tree(root,new_node);

        printf("\nDo you want to create more nodes");
	scanf("%c",&choice);   }

preorder(root);
return 0;

}