A. You can follow the below steps to search a binary search tree. (i) Compare the element with the tree’s root. (ii) If the item matches, return the node’s location. (iii) If the item doesn’t match, you need to check if the item is less than the element existing on the root. If so, you need to move to the left sub-tree. But if the item is more than the element existing on the root, move to the right sub-tree. (iv) Iterate this process until a match is found. (v) If no element is found, NULL is returned.