I am interested in database internals. Btrees come up with regard to designing database systems that are efficient to query on disk. Postgres uses them for its

I am interested in database internals. Btrees come up with regard to designing database systems that are efficient to query on disk. Postgres uses them for its indexes. Radix trees are memory efficient tries which are useful for answering prefix queries. They're also called prefix trees. I use them to get a list of prefixes of a string. Useful for simple intellisense style forms or dynamodb style querying. I've also been studying LSM trees which are used in Leveldb and RocksDB. I experiment with database technology in my experimental project hash-db https://github.com/samsquire/hash-db https://github.com/samsquire/hash-db The code should be readable. I need to change my search tree to be self balancing currently it grows to the left or right without balancing. I think I need to use tree rotation depending on which branch has the highest height.