Binary Search Tree in C | With simple code

Binary Search Tree
is a node-based binary tree data structure which has the following properties:
The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
The left and right subtree each must also be a binary search tree.

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

  typedef struct BST
  {
    int data;
    struct BST *left;
    struct BST *right;
  } node;

  node *create();
  void insert(node *, node *);
  void preorder(node *);

  int main()
  {
    char ch;
    node *root = NULL, *temp;
    do
    {
        temp = create();
        if (root == NULL)
            root = temp;
        else
            insert(root, temp);
        printf("\nDo you want to enter more(y/n)?");
        getchar();
        scanf("%c", &ch);
    } while (ch == 'y' | ch == 'Y');
    printf("\nPreorder Traversal: ");
    preorder(root);
    return 0;
  }

  node *create()
  {
    node *temp;
    printf("\nEnter data:");
    temp = (node *)malloc(sizeof(node));
    scanf("%d", &temp->data);
    temp->left = temp->right = NULL;
    return temp;
 }

  void insert(node *root, node *temp)
  {
    if (temp->data < root->data)
    {
        if (root->left != NULL)
            insert(root->left, temp);
        else
            root->left = temp;
    }
    if (temp->data > root->data)
    {
        if (root->right != NULL)
            insert(root->right, temp);
        else
            root->right = temp;
     }
 }

  void preorder(node *root)
  {
    if (root != NULL)
    {
        printf("%d ", root->data);
        preorder(root->left);
        preorder(root->right);
    }
  }

When the above program is executed, it produces following results --<\b>

   Enter data: 33
   
   Do you want to enter more(y/n)?y
   
   Enter data:90
   
   Do you want to enter more(y/n)?y
   
   Enter data:3
   
   Do you want to enter more(y/n)?y
   
   Enter data:19
   
   Do you want to enter more(y/n)?y
   
   Enter data:35

   Do you want to enter more(y/n)?n
   
   Preorder Traversal: 33 3 19 90 35