Where you asked to code in c++?

Wouldn't one way to verify this is to do an inorder traversal to see if you get back a sorted list at the end? The total cost in terms of time will be O(n) where n is the number of nodes in the BST.