BinarySearchTreeInsertion.c

#include <stdio.h>
#include <malloc.h>
struct node
{
    int data;
    struct node *left;
    struct node *right;
};
struct node *createNode(int data)
{
    struct node *n = (struct node *)malloc(sizeof(struct node));
    n->data = data;
    n->left = NULL;
    n->right = NULL;
    return n;
}
void inOrder(struct node *root)
{
    if(root != NULL)
    {
        inOrder(root->left);
        printf("%d ", root->data);
        inOrder(root->right);
    }
}

int isBST(struct node *root)
{
    static struct node *prev = NULL;
    if (root != NULL)
    {
        if(!isBST(root->left))
        {
            return 0;
        }
        if(prev != NULL && root->data <= prev->data)
        {
            return 0;
        }
        prev = root;
        return (isBST(root->right));
    }
    else
    {
        return 1;
    }
    
}
void insert(struct node *root, int key)
{
    struct node *prev = NULL;
    while(root != NULL)
    {
        prev = root;
        if(root->data == key)
            return;
        else if(key < root->data)
            root = root->left;
        else 
            root = root->right;
    }
    struct node *new = createNode(key);
    if(key < prev->data)
        prev->left  = new;
    else 
        prev->right = new;
}
int main()
{
    struct node *p = createNode(5);
    struct node *p1 = createNode(3);
    struct node *p2 = createNode(6);
    struct node *p3 = createNode(1);
    struct node *p4 = createNode(4);

    p->left = p1;
    p->right = p2;

    p1->left = p3;
    p1->right = p4;
    inOrder(p);
    printf("\n");
    printf("%d", isBST(p));
    printf("\n");
    insert(p, 2);
    inOrder(p);
    printf("\n");
    insert(p, 5);
    inOrder(p);
    
    printf("\n");
    insert(p, 50);
    inOrder(p);
}