Ternary minimizes both the length and number of different symbols used to express a range of numbers[1]. Heap trees were probably optimized for binary, since t

Ternary minimizes both the length and number of different symbols used to express a range of numbers[1]. Heap trees were probably optimized for binary, since that's what we use. Perhaps there would be a ternary version of heap trees? Or a totally different ternary data structure that serves the same purpose? [1]: https://math.stackexchange.com/questions/446664/what-is-the-most-efficient-numerical-base-system https://math.stackexchange.com/questions/446664/what-is-the-...