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