1) Which of the following statements are true about Linked Lists. a) Linked Lists use exactly as much memory as is needed for for all nodes. b) Linked Lists always have a head reference c) Linked Lists can grow dynamically d) None of these answers. e) Linked Lists are efficient when you need random access. 2) What is the average Big O runtime of retrieving a value of an item in a link list given its index? a) O(n) b) O(1) c) O(n^2) d) None of these answers. e) O(nlogn) 3) When does the insert() function of a Dynamic List have a big O runtime of O(1)? a) When you are inserting to the end of the list. b) When you are inserting to the beginning of the list. c) When the size of the data is small. d) None of these answers.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Trending now
This is a popular solution!
Step by step
Solved in 2 steps