Although not included in appendix A, the standard library defines

together with a function

that decides if one value in an ordered type is less than (LT), equal (EQ), or greater than (GT) another such value. Using this function, redefine the function occurs: Int Tree Bool for search trees. Why is this new definition more efficient than the original version?