If a Binary Search Tree was implemented incorrectly such that a node has a left child that is not smaller than itself, how would you detect this violation? What is the most efficient method to identify this issue?