data structures using (step (step (step (step figure binary search tree (step (step (step operations on binary search trees in this sectionwe will discuss the different operations that are performed on binary search tree all these operations require comparisons to be made between the nodes searching for node in binary search tree figure searching node with value in the given binary search tree the search function is used to find whether given value is present in the tree or not the searching process begins at the (step (step root node the function first checks if the binary search tree is empty if it is emptythen the value we are searching for is not present in the tree sothe search algorithm terminates by displaying an appropriate message howeverif there are nodes in the treethen the search function checks to see if the key value of the current node is equal to the value to be searched if notit checks if the value to be searched for is less than the value of the current nodein which case it should be recursively called on (step (step the left child node in case the value is greater than the value of the current nodeit should be recursively called on the right child node look at fig the figure shows how binary tree is searched to find specific element firstsee how the tree will be traversed to find the node with value the procedure to find the node with value is illustrated in fig the procedure to find the node with value is shown in fig the search would terminate after reaching figure searching node with value in the given binary search tree node as it does not have any right child