Binary Search Tree: A binary search tree is a data structure that organizes elements in a hierarchical manner, allowing for efficient searching, insertion, and deletion operations.
Hash Table: A hash table is a data structure that uses hashing to store and retrieve key-value pairs. It provides constant-time average case complexity for insertion, deletion, and retrieval operations.
Linked List: A linked list is a linear data structure where each element (node) contains both the actual value and a reference to the next node. It allows for efficient insertion and deletion at any position but has slower access time compared to arrays.