If a Binary Search Tree was implemented incorrectly, such that a number to the left of a node is not smaller as it should be, how would you detect this mistake? What is the most efficient way to identify such an error?