return nullreturn currentinsert operation whenever an element is to be insertedfirst locate its proper location start searching from the root nodethen if the data is less than the key valuesearch for the empty location in the left subtree and insert the data otherwisesearch for the empty location in the right subtree and insert the data algorithm void insert(int datastruct node *tempnode (struct node*malloc(sizeof(struct node))struct node *currentstruct node *parenttempnode->data datatempnode->leftchild nulltempnode->rightchild null//if tree is empty if(root =nullroot tempnodeelse current rootparent null