I am a dolt. Needless to say. Missed out on one of the trivial algorithmic puzzle.

Q) Given a node in the binary search tree, each node has three pointers - lchild, rchild and parent and as an associated value, how would find the node
which was value immediately greater than the given node. (next largest).

Try out the algorithm and comment pls.