C++ program to find inorder predecessor and successor for a given key in binary search tree with recursion

When you do the inorder traversal of a binary tree, the neighbors of given node are called Predecessor(the node lies behind of given node) and Successor (the node lies ahead of given node). Say you have to find the inorder predecessor and successor node 15.