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

find the inorder predecessor and successor of a node in BST .If the node is not found then return values within which it should exist Inorder successor of a node : if it has right child then it is the min of the right subtree else if it doesn't have one then it is the last left ancestor

Inorder predeccessor of a node : if it has left child then it is the max of the left subtree else if it doesn't have one then it is the last right ancestor

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas