Using BSTs for Table ADTs
	• Let's quickly look at a search algorithm for a binary search tree implemented using pointers (i.e., implementing our Retrieve ADT Table Operation): • The following is pseudo code: int retrieve (tree *root, key &k, data & value){ if (!root)       //we have an empty tree      return 0;