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

find the predecessor and successor of a given key node. If the key is not found then return the two values between which the key would have lied.

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas