Question: (d) A _reversely sorted_ linked list is a linked list where the nodes are sorted by their item values in a non-increasing order. For example,

 (d) A _reversely sorted_ linked list is a linked list where

(d) A _reversely sorted_ linked list is a linked list where the nodes are sorted by their item values in a non-increasing order. For example, 148 -> 12 -> 8 -> 5 -> 3 is a reversely sorted linked list. Which of the following operations for a reversely sorted linked list (of size n) has a worst-case time complexity that is strictly lower than O(n)? (That is, it is either 0(1) or 0(log n)). Note that the linked list must remain reversely sorted after each operation. Choose all that apply. A. Searching for a value B. Finding the maximum value c. Finding the minimum value D. Finding the second largest value E. Finding the second smallest value F. Inserting a new value G. Deleting a value if it exists H. Computing the average of all values (Marking note: 1 mark will deducted for each missing choice or wrong choice, up to a maximum deduction of 2 marks). TODO: write your choice(s) below (just the letters, A, B, etc.) [2 marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!