Binary search tree is given. Find element previous to the given in a tree.
Definition of a tree:
Implement function Prev that returns pointer to the previous element in a tree. If previous element does not exist, return NULL.
Function Prev with tree pointing to 12 returns pointer to the node with value 9.