The idea is that you create a hash map where the key is a tree hash and the value points to the tree in memory, so it should be O(1). Hash collision can of cour

The idea is that you create a hash map where the key is a tree hash and the value points to the tree in memory, so it should be O(1). Hash collision can of course happen but is extremely unlikely if you use a robust scheme like SHA256.