Computer Science - Data Structures - Linked lists - Linked List Analysis

8 questions. Q1: What is the time complexity of accessing the 5th element in a linked list? → O(n) - must traverse from head. Q2: What advantage does a linked list have over an array? → O(1) insertion/deletion at known position (no shifting). Q3: What does the last node's 'next' pointer hold? → None