Well I think you're overthinking that right now, I think this is "traversing a tree" O(log n) vs a "hash table lookup" O(1) But the main thing is that the hash

Well I think you're overthinking that right now, I think this is "traversing a tree" O(log n) vs a "hash table lookup" O(1) But the main thing is that the hash table lookup mostly is in the same memory area until you try to get the actual value out of it. Also the author mentions as a side note the problem with them "(though they do have their drawbacks in the worst-case scenarios, so you need to be careful)"