I don't understand "no explicit recursion". How do you do any kind of binary tree search without recursion?
This is easy to write in C, and I always imagined would be something functional programming would excel at, but it doesn't seem to fit with your rules.
The idea is that the only explicit recursion is contained in generic combinators "fold_result" and "unfold_result" that are "boring" in the sense that they can be derived mechanically from the "resultF" data type and do not actually know about the binary search; they just do recursion.
In practice, folds and unfolds tend to be more useful for other things.