Re:Using Rust to Scale Elixir for 11M Concurrent Users (2019)
by c0deb0t on Tuesday November 10, 2020 @09:54PM
(#25055040)
For binary trees, indexing can be done by saving the subtree size of each node and doing a sort of binary search. Not sure if this is fast for B-trees that have more than 2 children nodes, though.
[ Parent
| on HN ]