Skip to main content
Engineering LibreTexts

7.5: Ordered retrieval issue

  • Page ID
    47920
  • Hash tables store data in pseudo-random locations, so accessing the data in a sorted manner is a very time consuming operation. Other data structures such as self-balancing binary search trees generally operate more slowly (since their lookup time is O(log n)) and are rather more complex to implement than hash tables but maintain a sorted data structure at all times. See a comparison of hash tables and self-balancing binary search trees.

    • Was this article helpful?