Implement the read code: encode only once, fast tree traversal. Reading is now twice as fast as the unoptimized version and storage is 20% more efficient. Writing and deleting is still quite expensive though, at 2ms per item.
Implement the read code: encode only once, fast tree traversal.
Reading is now twice as fast as the unoptimized version and storage is 20% more efficient.
Writing and deleting is still quite expensive though, at 2ms per item.

koen-lee/compact-tree-challenge,koen-lee/compact-tree-challenge,koen-lee/compact-tree-challenge