Which data structure would be most efficient for implementing a cache with least recently used (LRU) eviction policy?

  • Binary Search Tree
  • Doubly Linked List
  • Hash Table
  • Priority Queue
A 'Doubly Linked List' is a common choice for implementing an LRU cache. It allows efficient insertion and removal of elements from both ends, making it suitable for the LRU policy.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *