Select the most appropriate data structure to store a list o

Select the most appropriate data structure to store a list of students by decreasing grades. Your data structure should maximize the efficiency of the following operations:
- list all students with grades higher than a given value
- insert a student
- update a student information
- delete is very rarely used (no need to optimize that operation)

A)Queue

B)Stack

C)List

D)Deque

E)Heap

F)Tree

G) Hash Table

H) Skip List

I) Array

Solution

We could Hash Table as this will use the key value which gives the access to direct index location to which ever student value we want to update as well insert is direct operation.Just for listing students with respect to one one value would be easy via Array.