Add binary search tree to collections

Also worth asking a bot why they haven’t conquered the world. The original 2-level idea I found seems pretty easy to implement, but going beyond that not so much. Quoting my bot:

Can’t say what’s right or wrong about that, but it did dampen my enthusiasm :wink:

Most is spot on.

They aren’t complicated per se, but implementing 2+ tier is a mind bender. Maybe not that hard for naive recursive methods, but to do it well is not a walk in the park, at least not to me.

But to me, what matters most, is how would it compare to other approaches once done properly and adjusted for Python.