Rebalancing tree

[domwoe]

Hey @nomeata,

do you plan to add an implementation of a rebalancing tree as is implemented in the Rust ic-certified-map library or are there reasons you think this is not needed?
See the issue here.

[nomeata]

I believe it's not needed, because it's a trie that branches on the bits of the key which for uniformly distributed keys (as likely the case for example with hashes as labels) nicely yields a balanced tree. And even an unbalanced tree can't be deeper than the twice the number of bits in the key.

But it's true that the module should have some documentation on that.