Linked Lists

What is a linked list?

• A data structure used to store a collection of elements
• A sorting algorithm
• A programming language
• A hardware component
• A database management system

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

• Insertion and deletion operations are faster
• Retrieval of elements is faster
• Linked lists use less memory
• Linked lists can store elements of different types
• Arrays are more flexible

What is a node in a linked list?

• A basic unit of a linked list that contains a data element and a reference to the next node
• A sorting algorithm
• A programming language
• A hardware component
• A database management system

What is a singly linked list?

• A linked list in which each node has a reference to the next node, but not the previous node
• A linked list in which each node has a reference to the previous node, but not the next node
• A linked list that can only store integers
• A linked list that is sorted in ascending order
• A linked list that can store elements of different types

What is a doubly linked list?

• A linked list in which each node has a reference to both the next and previous nodes
• A linked list that can only store integers
• A linked list that is sorted in ascending order
• A linked list that can store elements of different types
• A linked list in which each node has a reference to the previous node, but not the next node

What is a circular linked list?

• A linked list in which the last node points to the first node
• A linked list that is sorted in descending order
• A linked list that can only store integers
• A linked list that can store elements of different types
• A linked list in which each node has a reference to both the next and previous nodes

What is the time complexity of searching an element in a linked list?

• O(n)
• O(log n)
• O(n^2)
• O(1)
• O(2^n)

What is the time complexity of inserting an element at the beginning of a linked list?

• O(1)
• O(log n)
• O(n)
• O(n^2)
• O(2^n)

What is the time complexity of inserting an element at the end of a linked list?

• O(n)
• O(log n)
• O(1)
• O(n^2)
• O(2^n)

What is the time complexity of deleting an element from a linked list?

• O(n)
• O(log n)
• O(1)
• O(n^2)
• O(2^n)