What is the best (i.e. simple and fast) way to code a binary search tree in Julia nowadays?

(E.g. does it use `Nullable`

s? Or self-links from a node to itself to represent a missing child?)

This question has come up a few times in the past, but I haven’t been able to find a canonical, efficient answer.