I’ve been working on BSTOPS (https://www.codechef.com/problems/BSTOPS). 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 (https://en.wikipedia.org/wiki/Binary_search_tree#Deletion).