Linked List Quiz

What is a linked list?

• A data structure consisting of nodes where each node contains data and a reference to the next node

• A linear data structure with a fixed size

• A collection of elements stored at contiguous memory locations

• None of the above

How do you define a node in a singly linked list in Python?

• class Node: def **init**(self, data, next): self.data = data self.next = next

• class Node: def **init**(self, data): self.data = data self.next = None

• class Node: def **init**(self, data, prev, next): self.data = data self.prev = prev self.next = next

• None of the above

What is the main advantage of a linked list over an array?

• Fixed size

• Dynamic size and efficient insertion/deletion

• Faster access to elements

• Uses less memory

What is the correct way to traverse a linked list in Python?

• While loop

• For loop

• Recursion

• All of the above

How do you check if a linked list is empty?

• if head is None:

• if head == "":

• if head.next is None:

• if head == []:

What is the time complexity of inserting a node at the beginning of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a singly linked list, each node has:

• Data and a reference to the previous node

• Data and a reference to the next node

• Data and references to both previous and next nodes

• Only data

What is the last node of a singly linked list called?

• Tail

• Head

• Root

• Leaf

How do you insert a new node at the end of a singly linked list in Python?

• Traverse the list to find the last node and set its next reference to the new node

• Directly set the next reference of the last node to the new node

• Insert the node at the head

• Insert the node at a specific index

What does the "next" attribute in a node represent in a singly linked list?

• The previous node

• The next node

• The head node

• The tail node