The Trees Versus Bee Trees

In order to search not a single value by a single key, but like o range of values by a specific key, we need a structure that is different from a hash map. And one of the data structures that we can implement in memory is a tree. A binary tree only says that, ok, we have a note and two children, and they're not sorted in any way. If you are trying to implement binery, a searchtrea on disk, you're going to run into several problems.