These three data structures are mainly different in how they store and access the data:
A linear structure where each element (node) stores data and a pointer to the next node.
Easy insertion/deletion (O(1) if pointer is used).
Sequential access - you must traverse from the start to find an element (O(n)).
2. Binary tree (especially binary search tree – BST)
Hierarchical structure with nodes having left and right children.
Allows sorted storage and fast searching.
Balanced trees (like AVL) maintain efficiency.
3. Hash Table
Stores key value pairs using a hash function.
Access time is O(1) on average (very fast).
May have collisions (two keys mapping to same index).