Arrays and Linked Lists

Arrays

• Static vs Dynamic arrays
• Time complexity: O(1) access, O(n) insertion/deletion
• Space complexity: O(n)

Linked Lists

• Singly linked lists
• Doubly linked lists
• Circular linked lists

Operations

• Traversal
• Insertion
• Deletion
• Searching
• Reversal

Comparison

• Arrays provide fast random access
• Linked lists provide fast insertion/deletion at known positions

Applications

• Undo/Redo functionality
• Queue and Stack implementations
• Graph adjacency lists