Question 1
In terms of memory, how do nodes in a linked list differ from array elements?
Question 2
Why is removing the head node in a linked list considered an O(1) operation?
Question 3
Which operation on a singly linked list has a time complexity of O(n)?
Question 4
In a doubly linked list, what pointers does a node typically have?
Question 5
What is a common method to store node values when displaying a linked list?
Question 6
What characterizes the traversal time complexity for a linked list?
Question 7
Which operation can be efficiently performed in O(1) time on both singly and doubly linked lists?
Question 8
What class name is used to define a node in a singly linked list in the provided Python implementation?
Question 9
What is a key structural difference between singly and doubly linked lists?
Question 10
What is required to delete a node at a specific position in a singly linked list?
Question 11
When inserting at the end of a linked list, what must be adjusted?
Question 12
What does the 'next' pointer in a singly linked list node reference?
Question 13
In Python, how is a doubly linked list node initialized according to the notes?
Question 14
Why might linked lists be the preferred data structure in scenarios where elements are frequently added or removed?
Question 15
What is the primary advantage of a doubly linked list over a singly linked list?