struct node int datastruct node *leftchildstruct node *rightchild}search operation whenever an element is to be searchedstart searching from the root node then if the data is less than the key valuesearch for the element in the left subtree otherwisesearch for the element in the right subtree follow the same algorithm for each node algorithm struct nodesearch(int data)struct node *current rootprintf("visiting elements")while(current->data !data)if(current !nullprintf("% ",current->data)//go to left tree if(current->data data)current current->leftchild//else go to right tree else current current->rightchild//not found