Question

Write a procedure to search an element in a Binary Search Tree.

Answer 1

begin with root and compare the value of the node with the value you are searching for. if the number is less than or equal to then check its left node else check its right node and repeat this until you either find the element or you reach the leaf