2. For the following questions select the operation that is "faster" based on its Big-O running time? Write A, B or C in your answer sheet in each case i. Deleting a value: A. Deleting a value at the head of a linked-list B. Deleting a value from a sorted array C. Both are equally fast ii. Searching for an element: A. Searching for an element in a balanced BST B. Searching for an element in a sorted array using binary search C. Both are equally fast iii. Finding the minimum element: A. Finding the minimum element in a min Heap B. Finding the minimum element in a sorted array where elements are stored in ascending order C. Both are equally fast iv. Finding the minimum element: A. Finding the minimum element in an unsorted array B. Finding the minimum element in a balanced BST C. Both are equally fast V. Searching for an element: A. Searching for an element in a sorted linked list B. Searching for an element in a balanced BST C. Both are equally fast
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