Hi Community,
I found that the existing KeyRangeLookupTree implementation is Binary
Sorting Tree.
Although it is shuffled before insertion, it may still cause uneven
distribution. I want to implement it as a Red Black Tree. What do you think?
Thanks!

Reply via email to