• Arrays: Linear data structure with a fixed size, allowing random access to elements.

    • Best for: Static datasets with frequent element access.
    • Complexity:
      • Access: O(1)
      • Search: O(n)
      • Insertion/Deletion: O(n) Array

  • Linked Lists: Linear structure of nodes, where each node points to the next.

    • Types: Singly, Doubly, Circular.
    • Best for: Dynamic datasets with frequent insertions/deletions.
    • Complexity:
      • Access/Search: O(n)
      • Insertion/Deletion: O(1) (at head/tail with pointer)

  • Hash Maps (or Hash Tables): Key-value pair storage with a hash function.