If a Binary Search Tree was written incorrectly, lets say, a number to the left of a node isn't smaller like it should be, how would you catch this mistake? What's the most efficient way to figure this out?