Binary Search Tree _v1

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct bstnode{
	int data ;
	struct bstnode *left ;
	struct bstnode *right;
}bstnode;
void insert (bstnode **node , int data ){
	if(*node == NULL){
		bstnode * new_node = malloc(sizeof(bstnode));
		new_node->data =data ;
		new_node->left = NULL;
		new_node->right =NULL;
		*node = new_node ;
	}
	else if(data<=(*node)->data){
		insert(&((*node)->left),data);
	}
	else{insert(&((*node)->right),data);}
}
int main(){
	bstnode *root = malloc(sizeof(bstnode));
	root = NULL;
	insert(&root,10);
	insert(&root,20);
	insert(&root,15);
	insert(&root,25);
	insert(&root,30);
	insert(&root,35);
	return 0 ;
}