Inorder Predecessor Successor, is a BST related problem and in this post we will see how we can solve this challenge in C++

given a node ,find its inorder successor and predecessor in the BST. if the node doenst exits then find the nodes between which it should have existed

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas