BSTOPS solution?


I’ve been working on BSTOPS (BSTOPS Problem - CodeChef). The instructions don’t sufficiently specify what kind of binary tree implementation is required. I’ve submitted both possible implementations and neither seem to work, nor has anyone else been successful. Have all the attempts thus far been wrong, or is the official solution incorrect?

To clarify; the two possible implementations stem from two ways the delete operation can be implemented for a BST (Binary search tree - Wikipedia).


You have to print two values for node with two children

If you got the solution please help me at mine.
My solution is here:- CodeChef: Practical coding for everyone